java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/nested-3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:03:50,367 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:03:50,369 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:03:50,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:03:50,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:03:50,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:03:50,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:03:50,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:03:50,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:03:50,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:03:50,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:03:50,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:03:50,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:03:50,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:03:50,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:03:50,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:03:50,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:03:50,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:03:50,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:03:50,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:03:50,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:03:50,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:03:50,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:03:50,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:03:50,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:03:50,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:03:50,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:03:50,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:03:50,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:03:50,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:03:50,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:03:50,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:03:50,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:03:50,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:03:50,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:03:50,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:03:50,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:03:50,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:03:50,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:03:50,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:03:50,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:03:50,419 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-03 20:03:50,440 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:03:50,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:03:50,442 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 20:03:50,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 20:03:50,442 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 20:03:50,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:03:50,442 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:03:50,443 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 20:03:50,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:03:50,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:03:50,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:03:50,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:03:50,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:03:50,444 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:03:50,444 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:03:50,444 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 20:03:50,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:03:50,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:03:50,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:03:50,445 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 20:03:50,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 20:03:50,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:03:50,446 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:03:50,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:03:50,446 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 20:03:50,446 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 20:03:50,446 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:03:50,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:03:50,447 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 20:03:50,478 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:03:50,493 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:03:50,498 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:03:50,500 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:03:50,500 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:03:50,501 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/nested-3.c [2019-09-03 20:03:50,566 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f7c6369e/bfb18fbaac38434fae7b30ddcb51558c/FLAG360634e0b [2019-09-03 20:03:51,000 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:03:51,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/nested-3.c [2019-09-03 20:03:51,009 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f7c6369e/bfb18fbaac38434fae7b30ddcb51558c/FLAG360634e0b [2019-09-03 20:03:51,394 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f7c6369e/bfb18fbaac38434fae7b30ddcb51558c [2019-09-03 20:03:51,408 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:03:51,409 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:03:51,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:03:51,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:03:51,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:03:51,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:03:51" (1/1) ... [2019-09-03 20:03:51,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f255d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:03:51, skipping insertion in model container [2019-09-03 20:03:51,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:03:51" (1/1) ... [2019-09-03 20:03:51,427 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:03:51,446 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:03:51,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:03:51,647 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:03:51,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:03:51,676 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:03:51,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:03:51 WrapperNode [2019-09-03 20:03:51,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:03:51,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:03:51,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:03:51,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:03:51,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:03:51" (1/1) ... [2019-09-03 20:03:51,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:03:51" (1/1) ... [2019-09-03 20:03:51,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:03:51" (1/1) ... [2019-09-03 20:03:51,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:03:51" (1/1) ... [2019-09-03 20:03:51,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:03:51" (1/1) ... [2019-09-03 20:03:51,786 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:03:51" (1/1) ... [2019-09-03 20:03:51,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:03:51" (1/1) ... [2019-09-03 20:03:51,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:03:51,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:03:51,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:03:51,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:03:51,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:03:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:03:51,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:03:51,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:03:51,850 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:03:51,850 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:03:51,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:03:51,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:03:51,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:03:51,850 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:03:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:03:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:03:52,052 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:03:52,053 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 20:03:52,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:03:52 BoogieIcfgContainer [2019-09-03 20:03:52,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:03:52,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:03:52,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:03:52,059 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:03:52,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:03:51" (1/3) ... [2019-09-03 20:03:52,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab547b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:03:52, skipping insertion in model container [2019-09-03 20:03:52,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:03:51" (2/3) ... [2019-09-03 20:03:52,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab547b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:03:52, skipping insertion in model container [2019-09-03 20:03:52,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:03:52" (3/3) ... [2019-09-03 20:03:52,063 INFO L109 eAbstractionObserver]: Analyzing ICFG nested-3.c [2019-09-03 20:03:52,074 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:03:52,082 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:03:52,109 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:03:52,143 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 20:03:52,144 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:03:52,144 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 20:03:52,144 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:03:52,145 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:03:52,145 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:03:52,145 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:03:52,145 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:03:52,145 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:03:52,165 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-09-03 20:03:52,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:03:52,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:52,181 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:52,188 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:52,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:52,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1419324422, now seen corresponding path program 1 times [2019-09-03 20:03:52,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:52,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:52,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:52,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:03:52,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:52,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:52,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:03:52,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:03:52,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:03:52,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:03:52,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:03:52,362 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-09-03 20:03:52,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:52,436 INFO L93 Difference]: Finished difference Result 40 states and 61 transitions. [2019-09-03 20:03:52,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:03:52,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-03 20:03:52,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:52,445 INFO L225 Difference]: With dead ends: 40 [2019-09-03 20:03:52,445 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 20:03:52,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:03:52,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 20:03:52,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-09-03 20:03:52,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 20:03:52,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-09-03 20:03:52,485 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2019-09-03 20:03:52,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:52,486 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-09-03 20:03:52,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:03:52,486 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-09-03 20:03:52,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:03:52,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:52,487 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:52,488 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:52,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:52,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1519544262, now seen corresponding path program 1 times [2019-09-03 20:03:52,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:52,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:52,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:52,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:03:52,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:52,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:52,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:52,548 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:52,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:03:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:52,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-03 20:03:52,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:52,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:03:52,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:03:52,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-03 20:03:52,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:03:52,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:03:52,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:03:52,663 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 5 states. [2019-09-03 20:03:52,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:52,772 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2019-09-03 20:03:52,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:03:52,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 20:03:52,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:52,776 INFO L225 Difference]: With dead ends: 43 [2019-09-03 20:03:52,777 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 20:03:52,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:03:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 20:03:52,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-09-03 20:03:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 20:03:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-09-03 20:03:52,800 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 17 [2019-09-03 20:03:52,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:52,800 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-09-03 20:03:52,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:03:52,801 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-09-03 20:03:52,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:03:52,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:52,803 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:52,803 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:52,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:52,805 INFO L82 PathProgramCache]: Analyzing trace with hash -446333304, now seen corresponding path program 1 times [2019-09-03 20:03:52,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:52,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:52,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:52,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:03:52,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:52,913 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-03 20:03:52,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:52,913 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-03 20:03:52,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:52,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-03 20:03:52,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:53,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 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-03 20:03:53,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:03:53,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-09-03 20:03:53,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:03:53,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:03:53,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:03:53,014 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 7 states. [2019-09-03 20:03:53,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:53,172 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-09-03 20:03:53,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:03:53,172 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-09-03 20:03:53,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:53,175 INFO L225 Difference]: With dead ends: 67 [2019-09-03 20:03:53,175 INFO L226 Difference]: Without dead ends: 49 [2019-09-03 20:03:53,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:03:53,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-03 20:03:53,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2019-09-03 20:03:53,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-03 20:03:53,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2019-09-03 20:03:53,186 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 20 [2019-09-03 20:03:53,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:53,186 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2019-09-03 20:03:53,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:03:53,186 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2019-09-03 20:03:53,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 20:03:53,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:53,188 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:53,188 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:53,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:53,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1592335484, now seen corresponding path program 1 times [2019-09-03 20:03:53,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:53,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:53,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:53,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:03:53,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:53,277 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-03 20:03:53,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:53,278 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:03:53,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:53,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:03:53,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:53,331 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-03 20:03:53,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:53,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-03 20:03:53,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:03:53,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:03:53,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:03:53,345 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 6 states. [2019-09-03 20:03:53,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:53,413 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2019-09-03 20:03:53,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:03:53,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-09-03 20:03:53,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:53,415 INFO L225 Difference]: With dead ends: 77 [2019-09-03 20:03:53,415 INFO L226 Difference]: Without dead ends: 47 [2019-09-03 20:03:53,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:03:53,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-03 20:03:53,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2019-09-03 20:03:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 20:03:53,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2019-09-03 20:03:53,423 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 23 [2019-09-03 20:03:53,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:53,423 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2019-09-03 20:03:53,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:03:53,424 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2019-09-03 20:03:53,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:03:53,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:53,425 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:53,425 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:53,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:53,426 INFO L82 PathProgramCache]: Analyzing trace with hash 183500618, now seen corresponding path program 2 times [2019-09-03 20:03:53,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:53,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:53,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:53,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:03:53,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:53,488 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-03 20:03:53,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:53,488 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-03 20:03:53,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:03:53,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:03:53,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:53,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 20:03:53,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:53,561 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 20:03:53,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:53,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2019-09-03 20:03:53,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:03:53,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:03:53,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:03:53,567 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 9 states. [2019-09-03 20:03:53,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:53,735 INFO L93 Difference]: Finished difference Result 147 states and 185 transitions. [2019-09-03 20:03:53,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:03:53,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-09-03 20:03:53,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:53,737 INFO L225 Difference]: With dead ends: 147 [2019-09-03 20:03:53,737 INFO L226 Difference]: Without dead ends: 111 [2019-09-03 20:03:53,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:03:53,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-03 20:03:53,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 83. [2019-09-03 20:03:53,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-03 20:03:53,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-09-03 20:03:53,750 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 26 [2019-09-03 20:03:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:53,750 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-09-03 20:03:53,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:03:53,751 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-09-03 20:03:53,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 20:03:53,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:53,752 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:53,752 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:53,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:53,753 INFO L82 PathProgramCache]: Analyzing trace with hash 61682426, now seen corresponding path program 1 times [2019-09-03 20:03:53,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:53,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:53,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:53,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:53,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:53,836 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-03 20:03:53,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:53,837 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:53,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:03:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:53,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 20:03:53,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:53,890 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-03 20:03:53,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:53,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-09-03 20:03:53,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:03:53,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:03:53,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:03:53,904 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 8 states. [2019-09-03 20:03:53,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:53,983 INFO L93 Difference]: Finished difference Result 225 states and 269 transitions. [2019-09-03 20:03:53,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:03:53,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-09-03 20:03:53,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:53,985 INFO L225 Difference]: With dead ends: 225 [2019-09-03 20:03:53,985 INFO L226 Difference]: Without dead ends: 148 [2019-09-03 20:03:53,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:03:53,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-03 20:03:53,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 95. [2019-09-03 20:03:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-03 20:03:53,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2019-09-03 20:03:53,999 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 29 [2019-09-03 20:03:53,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:53,999 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2019-09-03 20:03:53,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:03:54,000 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2019-09-03 20:03:54,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 20:03:54,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:54,001 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:54,001 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:54,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:54,002 INFO L82 PathProgramCache]: Analyzing trace with hash -456768696, now seen corresponding path program 2 times [2019-09-03 20:03:54,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:54,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:54,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:54,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:03:54,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:54,069 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-03 20:03:54,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:54,070 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:03:54,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:54,102 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:03:54,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:54,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:03:54,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:54,114 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-03 20:03:54,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:54,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-03 20:03:54,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:03:54,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:03:54,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:03:54,120 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand 9 states. [2019-09-03 20:03:54,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:54,191 INFO L93 Difference]: Finished difference Result 249 states and 297 transitions. [2019-09-03 20:03:54,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:03:54,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-09-03 20:03:54,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:54,194 INFO L225 Difference]: With dead ends: 249 [2019-09-03 20:03:54,194 INFO L226 Difference]: Without dead ends: 160 [2019-09-03 20:03:54,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:03:54,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-03 20:03:54,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 107. [2019-09-03 20:03:54,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-03 20:03:54,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2019-09-03 20:03:54,208 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 32 [2019-09-03 20:03:54,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:54,208 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2019-09-03 20:03:54,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:03:54,208 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2019-09-03 20:03:54,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-03 20:03:54,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:54,210 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:54,210 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:54,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:54,211 INFO L82 PathProgramCache]: Analyzing trace with hash -931747782, now seen corresponding path program 3 times [2019-09-03 20:03:54,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:54,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:54,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:54,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:54,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:54,300 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-03 20:03:54,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:54,301 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-03 20:03:54,321 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:03:54,335 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:03:54,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:54,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 20:03:54,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:54,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:03:54,479 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-03 20:03:54,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:03:54,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2019-09-03 20:03:54,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:03:54,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:03:54,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:03:54,485 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand 17 states. [2019-09-03 20:03:54,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:54,868 INFO L93 Difference]: Finished difference Result 368 states and 443 transitions. [2019-09-03 20:03:54,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 20:03:54,869 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2019-09-03 20:03:54,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:54,871 INFO L225 Difference]: With dead ends: 368 [2019-09-03 20:03:54,871 INFO L226 Difference]: Without dead ends: 267 [2019-09-03 20:03:54,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:03:54,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-03 20:03:54,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 213. [2019-09-03 20:03:54,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-03 20:03:54,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 252 transitions. [2019-09-03 20:03:54,910 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 252 transitions. Word has length 35 [2019-09-03 20:03:54,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:54,913 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 252 transitions. [2019-09-03 20:03:54,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:03:54,913 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 252 transitions. [2019-09-03 20:03:54,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 20:03:54,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:54,916 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:54,917 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:54,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:54,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2081398016, now seen corresponding path program 3 times [2019-09-03 20:03:54,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:54,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:54,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:54,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:54,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:55,057 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-03 20:03:55,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:55,057 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:03:55,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:55,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 20:03:55,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:55,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:03:55,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 20:03:55,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:03:55,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2019-09-03 20:03:55,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:03:55,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:03:55,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:03:55,126 INFO L87 Difference]: Start difference. First operand 213 states and 252 transitions. Second operand 14 states. [2019-09-03 20:03:55,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:55,700 INFO L93 Difference]: Finished difference Result 532 states and 627 transitions. [2019-09-03 20:03:55,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 20:03:55,700 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2019-09-03 20:03:55,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:55,707 INFO L225 Difference]: With dead ends: 532 [2019-09-03 20:03:55,707 INFO L226 Difference]: Without dead ends: 403 [2019-09-03 20:03:55,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=550, Invalid=1342, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:03:55,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2019-09-03 20:03:55,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 252. [2019-09-03 20:03:55,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-09-03 20:03:55,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 296 transitions. [2019-09-03 20:03:55,736 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 296 transitions. Word has length 41 [2019-09-03 20:03:55,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:55,738 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 296 transitions. [2019-09-03 20:03:55,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:03:55,738 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 296 transitions. [2019-09-03 20:03:55,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 20:03:55,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:55,746 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:55,746 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:55,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:55,747 INFO L82 PathProgramCache]: Analyzing trace with hash 563878470, now seen corresponding path program 4 times [2019-09-03 20:03:55,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:55,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:55,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:55,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:55,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:55,895 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-03 20:03:55,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:55,896 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:03:55,924 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:55,944 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:03:55,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:55,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:03:55,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:55,962 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-03 20:03:55,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:55,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-09-03 20:03:55,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:03:55,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:03:55,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:03:55,975 INFO L87 Difference]: Start difference. First operand 252 states and 296 transitions. Second operand 13 states. [2019-09-03 20:03:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:56,070 INFO L93 Difference]: Finished difference Result 494 states and 583 transitions. [2019-09-03 20:03:56,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:03:56,071 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-09-03 20:03:56,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:56,073 INFO L225 Difference]: With dead ends: 494 [2019-09-03 20:03:56,073 INFO L226 Difference]: Without dead ends: 337 [2019-09-03 20:03:56,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:03:56,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-03 20:03:56,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 273. [2019-09-03 20:03:56,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-09-03 20:03:56,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 320 transitions. [2019-09-03 20:03:56,091 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 320 transitions. Word has length 44 [2019-09-03 20:03:56,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:56,091 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 320 transitions. [2019-09-03 20:03:56,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:03:56,092 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 320 transitions. [2019-09-03 20:03:56,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-03 20:03:56,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:56,093 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:56,093 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:56,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:56,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1295393276, now seen corresponding path program 5 times [2019-09-03 20:03:56,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:56,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:56,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:56,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:56,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:56,194 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-03 20:03:56,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:56,195 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:03:56,214 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:56,236 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-03 20:03:56,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:56,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:03:56,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:56,249 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-03 20:03:56,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:56,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-09-03 20:03:56,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:03:56,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:03:56,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:03:56,257 INFO L87 Difference]: Start difference. First operand 273 states and 320 transitions. Second operand 14 states. [2019-09-03 20:03:56,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:56,372 INFO L93 Difference]: Finished difference Result 527 states and 621 transitions. [2019-09-03 20:03:56,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:03:56,373 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2019-09-03 20:03:56,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:56,375 INFO L225 Difference]: With dead ends: 527 [2019-09-03 20:03:56,375 INFO L226 Difference]: Without dead ends: 358 [2019-09-03 20:03:56,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:03:56,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-09-03 20:03:56,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 294. [2019-09-03 20:03:56,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-03 20:03:56,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 344 transitions. [2019-09-03 20:03:56,392 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 344 transitions. Word has length 47 [2019-09-03 20:03:56,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:56,392 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 344 transitions. [2019-09-03 20:03:56,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:03:56,393 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 344 transitions. [2019-09-03 20:03:56,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 20:03:56,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:56,394 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:56,394 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:56,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:56,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1188918918, now seen corresponding path program 6 times [2019-09-03 20:03:56,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:56,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:56,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:56,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:56,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:56,507 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-03 20:03:56,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:56,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:03:56,525 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:56,541 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-03 20:03:56,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:56,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:03:56,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:56,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:03:56,706 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-09-03 20:03:56,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:03:56,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 22 [2019-09-03 20:03:56,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 20:03:56,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 20:03:56,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:03:56,711 INFO L87 Difference]: Start difference. First operand 294 states and 344 transitions. Second operand 22 states. [2019-09-03 20:03:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:57,792 INFO L93 Difference]: Finished difference Result 571 states and 675 transitions. [2019-09-03 20:03:57,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 20:03:57,793 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2019-09-03 20:03:57,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:57,797 INFO L225 Difference]: With dead ends: 571 [2019-09-03 20:03:57,797 INFO L226 Difference]: Without dead ends: 390 [2019-09-03 20:03:57,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=691, Invalid=1759, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 20:03:57,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-09-03 20:03:57,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 324. [2019-09-03 20:03:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-09-03 20:03:57,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 378 transitions. [2019-09-03 20:03:57,831 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 378 transitions. Word has length 50 [2019-09-03 20:03:57,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:57,833 INFO L475 AbstractCegarLoop]: Abstraction has 324 states and 378 transitions. [2019-09-03 20:03:57,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 20:03:57,833 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 378 transitions. [2019-09-03 20:03:57,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 20:03:57,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:57,835 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:57,835 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:57,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:57,836 INFO L82 PathProgramCache]: Analyzing trace with hash -636550396, now seen corresponding path program 1 times [2019-09-03 20:03:57,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:57,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:57,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:57,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:57,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:57,918 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-09-03 20:03:57,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:03:57,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:03:57,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:03:57,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:03:57,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:03:57,921 INFO L87 Difference]: Start difference. First operand 324 states and 378 transitions. Second operand 4 states. [2019-09-03 20:03:57,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:57,963 INFO L93 Difference]: Finished difference Result 507 states and 598 transitions. [2019-09-03 20:03:57,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:03:57,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-09-03 20:03:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:57,966 INFO L225 Difference]: With dead ends: 507 [2019-09-03 20:03:57,966 INFO L226 Difference]: Without dead ends: 331 [2019-09-03 20:03:57,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:03:57,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-03 20:03:57,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 320. [2019-09-03 20:03:57,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-03 20:03:57,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 372 transitions. [2019-09-03 20:03:57,988 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 372 transitions. Word has length 56 [2019-09-03 20:03:57,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:57,988 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 372 transitions. [2019-09-03 20:03:57,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:03:57,989 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 372 transitions. [2019-09-03 20:03:57,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 20:03:57,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:57,990 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 25, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:57,990 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:57,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:57,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1776455897, now seen corresponding path program 1 times [2019-09-03 20:03:57,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:57,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:57,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:57,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:03:57,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:58,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 577 proven. 287 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-09-03 20:03:58,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:58,182 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-03 20:03:58,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:58,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:03:58,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 575 proven. 287 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-09-03 20:03:58,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:58,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-09-03 20:03:58,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:03:58,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:03:58,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:03:58,276 INFO L87 Difference]: Start difference. First operand 320 states and 372 transitions. Second operand 17 states. [2019-09-03 20:03:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:58,413 INFO L93 Difference]: Finished difference Result 619 states and 727 transitions. [2019-09-03 20:03:58,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:03:58,414 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-03 20:03:58,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:58,418 INFO L225 Difference]: With dead ends: 619 [2019-09-03 20:03:58,418 INFO L226 Difference]: Without dead ends: 430 [2019-09-03 20:03:58,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:03:58,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-09-03 20:03:58,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 353. [2019-09-03 20:03:58,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-03 20:03:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 410 transitions. [2019-09-03 20:03:58,442 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 410 transitions. Word has length 104 [2019-09-03 20:03:58,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:58,442 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 410 transitions. [2019-09-03 20:03:58,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:03:58,443 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 410 transitions. [2019-09-03 20:03:58,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-03 20:03:58,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:58,444 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 28, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:58,445 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:58,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:58,445 INFO L82 PathProgramCache]: Analyzing trace with hash -168192999, now seen corresponding path program 2 times [2019-09-03 20:03:58,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:58,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:58,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:58,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:03:58,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1372 backedges. 709 proven. 330 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2019-09-03 20:03:58,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:58,676 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:58,686 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:03:58,728 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:03:58,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:58,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 20:03:58,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:58,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1372 backedges. 707 proven. 330 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2019-09-03 20:03:58,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:58,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-09-03 20:03:58,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:03:58,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:03:58,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:03:58,765 INFO L87 Difference]: Start difference. First operand 353 states and 410 transitions. Second operand 18 states. [2019-09-03 20:03:58,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:58,889 INFO L93 Difference]: Finished difference Result 651 states and 761 transitions. [2019-09-03 20:03:58,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 20:03:58,890 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 113 [2019-09-03 20:03:58,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:58,892 INFO L225 Difference]: With dead ends: 651 [2019-09-03 20:03:58,892 INFO L226 Difference]: Without dead ends: 438 [2019-09-03 20:03:58,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:03:58,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-09-03 20:03:58,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 374. [2019-09-03 20:03:58,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-09-03 20:03:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 434 transitions. [2019-09-03 20:03:58,914 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 434 transitions. Word has length 113 [2019-09-03 20:03:58,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:58,914 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 434 transitions. [2019-09-03 20:03:58,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:03:58,915 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 434 transitions. [2019-09-03 20:03:58,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-03 20:03:58,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:58,916 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 30, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:58,917 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:58,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:58,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1326858683, now seen corresponding path program 3 times [2019-09-03 20:03:58,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:58,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:58,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:58,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:58,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 804 proven. 376 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-09-03 20:03:59,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:59,111 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:59,121 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:03:59,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:03:59,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:59,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:03:59,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:59,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:03:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 48 proven. 805 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2019-09-03 20:03:59,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:59,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10] total 27 [2019-09-03 20:03:59,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 20:03:59,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 20:03:59,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:03:59,339 INFO L87 Difference]: Start difference. First operand 374 states and 434 transitions. Second operand 27 states. [2019-09-03 20:04:00,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:00,462 INFO L93 Difference]: Finished difference Result 972 states and 1142 transitions. [2019-09-03 20:04:00,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-03 20:04:00,462 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 119 [2019-09-03 20:04:00,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:00,466 INFO L225 Difference]: With dead ends: 972 [2019-09-03 20:04:00,466 INFO L226 Difference]: Without dead ends: 747 [2019-09-03 20:04:00,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=910, Invalid=2872, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 20:04:00,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-09-03 20:04:00,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 629. [2019-09-03 20:04:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-09-03 20:04:00,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 735 transitions. [2019-09-03 20:04:00,528 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 735 transitions. Word has length 119 [2019-09-03 20:04:00,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:00,529 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 735 transitions. [2019-09-03 20:04:00,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 20:04:00,529 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 735 transitions. [2019-09-03 20:04:00,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-03 20:04:00,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:00,534 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 32, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:00,534 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:00,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:00,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1998389019, now seen corresponding path program 1 times [2019-09-03 20:04:00,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:00,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:00,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:00,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:00,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:00,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1758 backedges. 905 proven. 425 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2019-09-03 20:04:00,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:00,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:00,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:04:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:00,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 20:04:00,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1758 backedges. 903 proven. 425 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:04:00,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:00,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-09-03 20:04:00,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 20:04:00,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 20:04:00,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:04:00,828 INFO L87 Difference]: Start difference. First operand 629 states and 735 transitions. Second operand 20 states. [2019-09-03 20:04:01,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:01,017 INFO L93 Difference]: Finished difference Result 1227 states and 1435 transitions. [2019-09-03 20:04:01,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:04:01,018 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 125 [2019-09-03 20:04:01,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:01,022 INFO L225 Difference]: With dead ends: 1227 [2019-09-03 20:04:01,023 INFO L226 Difference]: Without dead ends: 756 [2019-09-03 20:04:01,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:04:01,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2019-09-03 20:04:01,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 650. [2019-09-03 20:04:01,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-09-03 20:04:01,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 759 transitions. [2019-09-03 20:04:01,085 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 759 transitions. Word has length 125 [2019-09-03 20:04:01,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:01,085 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 759 transitions. [2019-09-03 20:04:01,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 20:04:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 759 transitions. [2019-09-03 20:04:01,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-03 20:04:01,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:01,089 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 34, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:01,090 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:01,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:01,090 INFO L82 PathProgramCache]: Analyzing trace with hash 803091133, now seen corresponding path program 2 times [2019-09-03 20:04:01,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:01,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:01,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:01,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:04:01,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:01,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 1012 proven. 477 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:04:01,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:01,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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:01,360 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:04:01,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:04:01,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:01,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:04:01,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 6 proven. 177 refuted. 0 times theorem prover too weak. 1786 trivial. 0 not checked. [2019-09-03 20:04:01,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:01,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 6] total 23 [2019-09-03 20:04:01,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:04:01,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:04:01,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:04:01,501 INFO L87 Difference]: Start difference. First operand 650 states and 759 transitions. Second operand 23 states. [2019-09-03 20:04:02,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:02,286 INFO L93 Difference]: Finished difference Result 3014 states and 3340 transitions. [2019-09-03 20:04:02,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 20:04:02,287 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 131 [2019-09-03 20:04:02,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:02,299 INFO L225 Difference]: With dead ends: 3014 [2019-09-03 20:04:02,299 INFO L226 Difference]: Without dead ends: 2531 [2019-09-03 20:04:02,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=633, Invalid=1089, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 20:04:02,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2019-09-03 20:04:02,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 674. [2019-09-03 20:04:02,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-09-03 20:04:02,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 788 transitions. [2019-09-03 20:04:02,405 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 788 transitions. Word has length 131 [2019-09-03 20:04:02,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:02,406 INFO L475 AbstractCegarLoop]: Abstraction has 674 states and 788 transitions. [2019-09-03 20:04:02,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:04:02,406 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 788 transitions. [2019-09-03 20:04:02,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-03 20:04:02,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:02,409 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 36, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:02,409 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:02,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:02,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1172808283, now seen corresponding path program 3 times [2019-09-03 20:04:02,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:02,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:02,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:02,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:02,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:02,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2192 backedges. 1125 proven. 532 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2019-09-03 20:04:02,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:02,671 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:02,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:04:02,698 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:04:02,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:02,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:04:02,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:02,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:04:02,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2192 backedges. 57 proven. 1126 refuted. 0 times theorem prover too weak. 1009 trivial. 0 not checked. [2019-09-03 20:04:02,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:02,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10] total 30 [2019-09-03 20:04:02,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 20:04:02,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 20:04:02,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=619, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:04:02,905 INFO L87 Difference]: Start difference. First operand 674 states and 788 transitions. Second operand 30 states. [2019-09-03 20:04:05,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:05,651 INFO L93 Difference]: Finished difference Result 2320 states and 2555 transitions. [2019-09-03 20:04:05,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-03 20:04:05,652 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 137 [2019-09-03 20:04:05,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:05,664 INFO L225 Difference]: With dead ends: 2320 [2019-09-03 20:04:05,664 INFO L226 Difference]: Without dead ends: 1819 [2019-09-03 20:04:05,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2153 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1930, Invalid=6442, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 20:04:05,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2019-09-03 20:04:05,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 719. [2019-09-03 20:04:05,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-09-03 20:04:05,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 840 transitions. [2019-09-03 20:04:05,760 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 840 transitions. Word has length 137 [2019-09-03 20:04:05,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:05,760 INFO L475 AbstractCegarLoop]: Abstraction has 719 states and 840 transitions. [2019-09-03 20:04:05,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 20:04:05,760 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 840 transitions. [2019-09-03 20:04:05,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:04:05,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:05,763 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 38, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:05,763 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:05,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:05,763 INFO L82 PathProgramCache]: Analyzing trace with hash 96770813, now seen corresponding path program 4 times [2019-09-03 20:04:05,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:05,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:05,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:05,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:05,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:06,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2427 backedges. 1244 proven. 590 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2019-09-03 20:04:06,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:06,083 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) [2019-09-03 20:04:06,106 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:06,132 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:04:06,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:06,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:04:06,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:06,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2427 backedges. 1797 proven. 79 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-09-03 20:04:06,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:06,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2019-09-03 20:04:06,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 20:04:06,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 20:04:06,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=1471, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:04:06,560 INFO L87 Difference]: Start difference. First operand 719 states and 840 transitions. Second operand 45 states. [2019-09-03 20:04:08,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:08,922 INFO L93 Difference]: Finished difference Result 2653 states and 2965 transitions. [2019-09-03 20:04:08,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 20:04:08,922 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 143 [2019-09-03 20:04:08,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:08,931 INFO L225 Difference]: With dead ends: 2653 [2019-09-03 20:04:08,931 INFO L226 Difference]: Without dead ends: 2116 [2019-09-03 20:04:08,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1765 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1586, Invalid=6070, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 20:04:08,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2019-09-03 20:04:09,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 1091. [2019-09-03 20:04:09,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1091 states. [2019-09-03 20:04:09,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1231 transitions. [2019-09-03 20:04:09,078 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1231 transitions. Word has length 143 [2019-09-03 20:04:09,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:09,079 INFO L475 AbstractCegarLoop]: Abstraction has 1091 states and 1231 transitions. [2019-09-03 20:04:09,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 20:04:09,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1231 transitions. [2019-09-03 20:04:09,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-03 20:04:09,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:09,082 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 40, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:09,082 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:09,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:09,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1446056993, now seen corresponding path program 5 times [2019-09-03 20:04:09,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:09,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:09,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:09,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:09,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:09,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2674 backedges. 1369 proven. 651 refuted. 0 times theorem prover too weak. 654 trivial. 0 not checked. [2019-09-03 20:04:09,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:09,337 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:09,356 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:04:09,397 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2019-09-03 20:04:09,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:09,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:04:09,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:09,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2674 backedges. 1367 proven. 651 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2019-09-03 20:04:09,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:09,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-09-03 20:04:09,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:04:09,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:04:09,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:04:09,448 INFO L87 Difference]: Start difference. First operand 1091 states and 1231 transitions. Second operand 24 states. [2019-09-03 20:04:10,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:10,091 INFO L93 Difference]: Finished difference Result 3110 states and 3400 transitions. [2019-09-03 20:04:10,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 20:04:10,096 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 149 [2019-09-03 20:04:10,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:10,105 INFO L225 Difference]: With dead ends: 3110 [2019-09-03 20:04:10,106 INFO L226 Difference]: Without dead ends: 2215 [2019-09-03 20:04:10,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:04:10,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2019-09-03 20:04:10,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1142. [2019-09-03 20:04:10,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1142 states. [2019-09-03 20:04:10,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1290 transitions. [2019-09-03 20:04:10,278 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1290 transitions. Word has length 149 [2019-09-03 20:04:10,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:10,278 INFO L475 AbstractCegarLoop]: Abstraction has 1142 states and 1290 transitions. [2019-09-03 20:04:10,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:04:10,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1290 transitions. [2019-09-03 20:04:10,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-03 20:04:10,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:10,281 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 42, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:10,282 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:10,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:10,282 INFO L82 PathProgramCache]: Analyzing trace with hash 66503417, now seen corresponding path program 6 times [2019-09-03 20:04:10,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:10,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:10,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:10,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:10,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2933 backedges. 1500 proven. 715 refuted. 0 times theorem prover too weak. 718 trivial. 0 not checked. [2019-09-03 20:04:10,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:10,597 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:04:10,627 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:10,648 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-03 20:04:10,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:10,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:04:10,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:10,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:04:10,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2933 backedges. 66 proven. 1501 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2019-09-03 20:04:10,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:10,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 10] total 33 [2019-09-03 20:04:10,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 20:04:10,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 20:04:10,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=735, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:04:10,834 INFO L87 Difference]: Start difference. First operand 1142 states and 1290 transitions. Second operand 33 states. [2019-09-03 20:04:13,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:13,030 INFO L93 Difference]: Finished difference Result 3297 states and 3618 transitions. [2019-09-03 20:04:13,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 20:04:13,033 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 155 [2019-09-03 20:04:13,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:13,043 INFO L225 Difference]: With dead ends: 3297 [2019-09-03 20:04:13,043 INFO L226 Difference]: Without dead ends: 2363 [2019-09-03 20:04:13,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1342 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1567, Invalid=4753, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 20:04:13,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2019-09-03 20:04:13,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 1273. [2019-09-03 20:04:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1273 states. [2019-09-03 20:04:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1437 transitions. [2019-09-03 20:04:13,253 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1437 transitions. Word has length 155 [2019-09-03 20:04:13,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:13,253 INFO L475 AbstractCegarLoop]: Abstraction has 1273 states and 1437 transitions. [2019-09-03 20:04:13,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 20:04:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1437 transitions. [2019-09-03 20:04:13,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-03 20:04:13,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:13,256 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 45, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:13,256 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:13,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:13,257 INFO L82 PathProgramCache]: Analyzing trace with hash 803235525, now seen corresponding path program 1 times [2019-09-03 20:04:13,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:13,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:13,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:13,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:13,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:13,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3344 backedges. 1708 proven. 782 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2019-09-03 20:04:13,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:13,648 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:13,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:04:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:13,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 20:04:13,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3344 backedges. 1705 proven. 782 refuted. 0 times theorem prover too weak. 857 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-03 20:04:13,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:13,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 28 [2019-09-03 20:04:13,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 20:04:13,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 20:04:13,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=427, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:04:13,743 INFO L87 Difference]: Start difference. First operand 1273 states and 1437 transitions. Second operand 28 states. [2019-09-03 20:04:14,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:14,952 INFO L93 Difference]: Finished difference Result 3796 states and 4207 transitions. [2019-09-03 20:04:14,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 20:04:14,952 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 164 [2019-09-03 20:04:14,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:14,961 INFO L225 Difference]: With dead ends: 3796 [2019-09-03 20:04:14,961 INFO L226 Difference]: Without dead ends: 2743 [2019-09-03 20:04:14,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=981, Invalid=1775, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:04:14,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2743 states. [2019-09-03 20:04:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2743 to 1668. [2019-09-03 20:04:15,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2019-09-03 20:04:15,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 1907 transitions. [2019-09-03 20:04:15,133 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 1907 transitions. Word has length 164 [2019-09-03 20:04:15,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:15,134 INFO L475 AbstractCegarLoop]: Abstraction has 1668 states and 1907 transitions. [2019-09-03 20:04:15,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 20:04:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 1907 transitions. [2019-09-03 20:04:15,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-03 20:04:15,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:15,137 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 46, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:15,137 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:15,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:15,137 INFO L82 PathProgramCache]: Analyzing trace with hash 489628795, now seen corresponding path program 2 times [2019-09-03 20:04:15,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:15,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:15,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:15,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:04:15,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:15,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3487 backedges. 1781 proven. 852 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2019-09-03 20:04:15,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:15,465 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-03 20:04:15,474 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:04:15,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:04:15,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:15,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 20:04:15,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:15,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3487 backedges. 6 proven. 2580 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2019-09-03 20:04:15,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:15,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-03 20:04:15,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 20:04:15,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 20:04:15,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=479, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:04:15,568 INFO L87 Difference]: Start difference. First operand 1668 states and 1907 transitions. Second operand 29 states. [2019-09-03 20:04:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:16,755 INFO L93 Difference]: Finished difference Result 3126 states and 3430 transitions. [2019-09-03 20:04:16,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 20:04:16,756 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 167 [2019-09-03 20:04:16,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:16,763 INFO L225 Difference]: With dead ends: 3126 [2019-09-03 20:04:16,763 INFO L226 Difference]: Without dead ends: 2828 [2019-09-03 20:04:16,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=981, Invalid=1775, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:04:16,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2828 states. [2019-09-03 20:04:16,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2828 to 1852. [2019-09-03 20:04:16,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1852 states. [2019-09-03 20:04:16,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 2113 transitions. [2019-09-03 20:04:16,915 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 2113 transitions. Word has length 167 [2019-09-03 20:04:16,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:16,916 INFO L475 AbstractCegarLoop]: Abstraction has 1852 states and 2113 transitions. [2019-09-03 20:04:16,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 20:04:16,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2113 transitions. [2019-09-03 20:04:16,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-03 20:04:16,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:16,919 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 48, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:16,919 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:16,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:16,919 INFO L82 PathProgramCache]: Analyzing trace with hash 430050525, now seen corresponding path program 3 times [2019-09-03 20:04:16,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:16,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:16,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:16,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:16,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:17,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 1930 proven. 925 refuted. 0 times theorem prover too weak. 927 trivial. 0 not checked. [2019-09-03 20:04:17,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:17,252 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-03 20:04:17,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:04:17,280 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 20:04:17,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:17,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 20:04:17,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:17,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 1 proven. 1931 refuted. 0 times theorem prover too weak. 1850 trivial. 0 not checked. [2019-09-03 20:04:17,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:17,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 10] total 37 [2019-09-03 20:04:17,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:04:17,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:04:17,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=960, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:04:17,537 INFO L87 Difference]: Start difference. First operand 1852 states and 2113 transitions. Second operand 37 states. [2019-09-03 20:04:21,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:21,211 INFO L93 Difference]: Finished difference Result 4740 states and 5301 transitions. [2019-09-03 20:04:21,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-09-03 20:04:21,211 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 173 [2019-09-03 20:04:21,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:21,221 INFO L225 Difference]: With dead ends: 4740 [2019-09-03 20:04:21,221 INFO L226 Difference]: Without dead ends: 3206 [2019-09-03 20:04:21,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6144 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3913, Invalid=16967, Unknown=0, NotChecked=0, Total=20880 [2019-09-03 20:04:21,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2019-09-03 20:04:21,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 1924. [2019-09-03 20:04:21,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1924 states. [2019-09-03 20:04:21,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2190 transitions. [2019-09-03 20:04:21,538 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2190 transitions. Word has length 173 [2019-09-03 20:04:21,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:21,538 INFO L475 AbstractCegarLoop]: Abstraction has 1924 states and 2190 transitions. [2019-09-03 20:04:21,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:04:21,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2190 transitions. [2019-09-03 20:04:21,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-03 20:04:21,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:21,546 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 72, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:21,546 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:21,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:21,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1896383560, now seen corresponding path program 4 times [2019-09-03 20:04:21,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:21,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:21,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:21,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:21,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 8573 backedges. 3858 proven. 925 refuted. 0 times theorem prover too weak. 3790 trivial. 0 not checked. [2019-09-03 20:04:21,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:21,945 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-03 20:04:21,955 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:04:22,010 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:04:22,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:22,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 20:04:22,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:22,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8573 backedges. 3854 proven. 925 refuted. 0 times theorem prover too weak. 3794 trivial. 0 not checked. [2019-09-03 20:04:22,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:22,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-09-03 20:04:22,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 20:04:22,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 20:04:22,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:04:22,054 INFO L87 Difference]: Start difference. First operand 1924 states and 2190 transitions. Second operand 28 states. [2019-09-03 20:04:22,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:22,958 INFO L93 Difference]: Finished difference Result 4576 states and 5114 transitions. [2019-09-03 20:04:22,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 20:04:22,959 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 257 [2019-09-03 20:04:22,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:22,967 INFO L225 Difference]: With dead ends: 4576 [2019-09-03 20:04:22,967 INFO L226 Difference]: Without dead ends: 3068 [2019-09-03 20:04:22,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:04:22,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2019-09-03 20:04:23,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 1997. [2019-09-03 20:04:23,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-09-03 20:04:23,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2272 transitions. [2019-09-03 20:04:23,234 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2272 transitions. Word has length 257 [2019-09-03 20:04:23,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:23,235 INFO L475 AbstractCegarLoop]: Abstraction has 1997 states and 2272 transitions. [2019-09-03 20:04:23,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 20:04:23,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2272 transitions. [2019-09-03 20:04:23,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-03 20:04:23,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:23,241 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 75, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:23,241 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:23,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:23,241 INFO L82 PathProgramCache]: Analyzing trace with hash -411062936, now seen corresponding path program 5 times [2019-09-03 20:04:23,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:23,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:23,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:23,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:23,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:23,639 INFO L134 CoverageAnalysis]: Checked inductivity of 9266 backedges. 4168 proven. 1001 refuted. 0 times theorem prover too weak. 4097 trivial. 0 not checked. [2019-09-03 20:04:23,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:23,639 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:23,651 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:04:23,747 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 51 check-sat command(s) [2019-09-03 20:04:23,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:23,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:04:23,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:24,471 INFO L134 CoverageAnalysis]: Checked inductivity of 9266 backedges. 4332 proven. 950 refuted. 0 times theorem prover too weak. 3984 trivial. 0 not checked. [2019-09-03 20:04:24,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:24,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 58 [2019-09-03 20:04:24,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 20:04:24,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 20:04:24,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=870, Invalid=2436, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 20:04:24,476 INFO L87 Difference]: Start difference. First operand 1997 states and 2272 transitions. Second operand 58 states. [2019-09-03 20:04:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:41,344 INFO L93 Difference]: Finished difference Result 13353 states and 15639 transitions. [2019-09-03 20:04:41,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 489 states. [2019-09-03 20:04:41,344 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 266 [2019-09-03 20:04:41,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:41,378 INFO L225 Difference]: With dead ends: 13353 [2019-09-03 20:04:41,378 INFO L226 Difference]: Without dead ends: 11624 [2019-09-03 20:04:41,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1128 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 487 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130224 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=72939, Invalid=165693, Unknown=0, NotChecked=0, Total=238632 [2019-09-03 20:04:41,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11624 states. [2019-09-03 20:04:42,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11624 to 7381. [2019-09-03 20:04:42,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7381 states. [2019-09-03 20:04:42,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7381 states to 7381 states and 8013 transitions. [2019-09-03 20:04:42,947 INFO L78 Accepts]: Start accepts. Automaton has 7381 states and 8013 transitions. Word has length 266 [2019-09-03 20:04:42,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:42,947 INFO L475 AbstractCegarLoop]: Abstraction has 7381 states and 8013 transitions. [2019-09-03 20:04:42,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 20:04:42,947 INFO L276 IsEmpty]: Start isEmpty. Operand 7381 states and 8013 transitions. [2019-09-03 20:04:42,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-09-03 20:04:42,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:42,967 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 78, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:42,968 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:42,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:42,968 INFO L82 PathProgramCache]: Analyzing trace with hash 2055082424, now seen corresponding path program 6 times [2019-09-03 20:04:42,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:42,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:42,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:42,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:42,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 9986 backedges. 4490 proven. 1080 refuted. 0 times theorem prover too weak. 4416 trivial. 0 not checked. [2019-09-03 20:04:43,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:43,378 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:04:43,406 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:43,433 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-03 20:04:43,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:43,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:04:43,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:43,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:04:43,612 INFO L134 CoverageAnalysis]: Checked inductivity of 9986 backedges. 4577 proven. 1 refuted. 0 times theorem prover too weak. 5408 trivial. 0 not checked. [2019-09-03 20:04:43,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:43,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 38 [2019-09-03 20:04:43,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 20:04:43,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 20:04:43,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=949, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:04:43,617 INFO L87 Difference]: Start difference. First operand 7381 states and 8013 transitions. Second operand 38 states. [2019-09-03 20:04:46,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:46,270 INFO L93 Difference]: Finished difference Result 14610 states and 15978 transitions. [2019-09-03 20:04:46,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:04:46,271 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 275 [2019-09-03 20:04:46,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:46,271 INFO L225 Difference]: With dead ends: 14610 [2019-09-03 20:04:46,271 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:04:46,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1387, Invalid=3035, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:04:46,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:04:46,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:04:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:04:46,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:04:46,295 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 275 [2019-09-03 20:04:46,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:46,295 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:04:46,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 20:04:46,295 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:04:46,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:04:46,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.