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/locks/test_locks_11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 16:18:14,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:18:14,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:18:14,401 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:18:14,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:18:14,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:18:14,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:18:14,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:18:14,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:18:14,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:18:14,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:18:14,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:18:14,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:18:14,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:18:14,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:18:14,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:18:14,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:18:14,429 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:18:14,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:18:14,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:18:14,442 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:18:14,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:18:14,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:18:14,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:18:14,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:18:14,451 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:18:14,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:18:14,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:18:14,454 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:18:14,455 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:18:14,455 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:18:14,458 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:18:14,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:18:14,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:18:14,461 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:18:14,461 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:18:14,462 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:18:14,462 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:18:14,462 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:18:14,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:18:14,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:18:14,468 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-16 16:18:14,493 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:18:14,493 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:18:14,495 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:18:14,495 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:18:14,495 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:18:14,495 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:18:14,496 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:18:14,496 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:18:14,496 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:18:14,496 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:18:14,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:18:14,498 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:18:14,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:18:14,498 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:18:14,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:18:14,499 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:18:14,499 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:18:14,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:18:14,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:18:14,500 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:18:14,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:18:14,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:18:14,500 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:18:14,500 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:18:14,501 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:18:14,501 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:18:14,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:18:14,501 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:18:14,502 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:18:14,554 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:18:14,569 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:18:14,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:18:14,576 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:18:14,576 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:18:14,577 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2019-09-16 16:18:14,632 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cfe3cf33/3628af80d0db4e4bb4f99185cb16a0f6/FLAGfa885e37d [2019-09-16 16:18:15,077 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:18:15,079 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2019-09-16 16:18:15,091 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cfe3cf33/3628af80d0db4e4bb4f99185cb16a0f6/FLAGfa885e37d [2019-09-16 16:18:15,480 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cfe3cf33/3628af80d0db4e4bb4f99185cb16a0f6 [2019-09-16 16:18:15,491 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:18:15,492 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:18:15,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:18:15,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:18:15,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:18:15,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:18:15" (1/1) ... [2019-09-16 16:18:15,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c806856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:15, skipping insertion in model container [2019-09-16 16:18:15,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:18:15" (1/1) ... [2019-09-16 16:18:15,507 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:18:15,529 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:18:15,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:18:15,731 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:18:15,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:18:15,864 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:18:15,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:15 WrapperNode [2019-09-16 16:18:15,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:18:15,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:18:15,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:18:15,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:18:15,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:15" (1/1) ... [2019-09-16 16:18:15,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:15" (1/1) ... [2019-09-16 16:18:15,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:15" (1/1) ... [2019-09-16 16:18:15,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:15" (1/1) ... [2019-09-16 16:18:15,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:15" (1/1) ... [2019-09-16 16:18:15,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:15" (1/1) ... [2019-09-16 16:18:15,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:15" (1/1) ... [2019-09-16 16:18:15,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:18:15,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:18:15,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:18:15,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:18:15,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:15" (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-16 16:18:15,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:18:15,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:18:15,951 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:18:15,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:18:15,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 16:18:15,951 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:18:15,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:18:15,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:18:16,225 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:18:16,226 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 16:18:16,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:18:16 BoogieIcfgContainer [2019-09-16 16:18:16,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:18:16,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:18:16,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:18:16,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:18:16,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:18:15" (1/3) ... [2019-09-16 16:18:16,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748cde50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:18:16, skipping insertion in model container [2019-09-16 16:18:16,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:15" (2/3) ... [2019-09-16 16:18:16,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748cde50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:18:16, skipping insertion in model container [2019-09-16 16:18:16,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:18:16" (3/3) ... [2019-09-16 16:18:16,234 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2019-09-16 16:18:16,246 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:18:16,255 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 16:18:16,276 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 16:18:16,348 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:18:16,349 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:18:16,349 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:18:16,349 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:18:16,349 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:18:16,349 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:18:16,350 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:18:16,350 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:18:16,350 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:18:16,374 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-09-16 16:18:16,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 16:18:16,380 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:16,381 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:16,382 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:16,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:16,386 INFO L82 PathProgramCache]: Analyzing trace with hash -316470182, now seen corresponding path program 1 times [2019-09-16 16:18:16,388 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:16,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:16,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:16,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:16,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:16,578 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-16 16:18:16,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:16,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:16,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:16,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:16,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:16,605 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2019-09-16 16:18:16,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:16,685 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2019-09-16 16:18:16,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:16,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-16 16:18:16,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:16,698 INFO L225 Difference]: With dead ends: 93 [2019-09-16 16:18:16,698 INFO L226 Difference]: Without dead ends: 78 [2019-09-16 16:18:16,701 INFO L636 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-16 16:18:16,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-16 16:18:16,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2019-09-16 16:18:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-16 16:18:16,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2019-09-16 16:18:16,747 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 21 [2019-09-16 16:18:16,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:16,748 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2019-09-16 16:18:16,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:16,748 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2019-09-16 16:18:16,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 16:18:16,749 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:16,749 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:16,750 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:16,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:16,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1327587432, now seen corresponding path program 1 times [2019-09-16 16:18:16,751 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:16,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:16,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:16,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:16,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:16,842 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-16 16:18:16,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:16,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:16,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:16,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:16,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:16,848 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2019-09-16 16:18:16,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:16,887 INFO L93 Difference]: Finished difference Result 127 states and 232 transitions. [2019-09-16 16:18:16,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:16,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-16 16:18:16,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:16,889 INFO L225 Difference]: With dead ends: 127 [2019-09-16 16:18:16,890 INFO L226 Difference]: Without dead ends: 78 [2019-09-16 16:18:16,891 INFO L636 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-16 16:18:16,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-16 16:18:16,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-09-16 16:18:16,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-16 16:18:16,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2019-09-16 16:18:16,912 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 21 [2019-09-16 16:18:16,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:16,912 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2019-09-16 16:18:16,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:16,913 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2019-09-16 16:18:16,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 16:18:16,914 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:16,914 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:16,914 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:16,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:16,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1220427994, now seen corresponding path program 1 times [2019-09-16 16:18:16,915 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:16,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:16,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:16,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:16,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:16,968 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-16 16:18:16,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:16,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:16,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:16,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:16,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:16,970 INFO L87 Difference]: Start difference. First operand 76 states and 137 transitions. Second operand 3 states. [2019-09-16 16:18:16,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:16,995 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2019-09-16 16:18:16,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:16,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-16 16:18:16,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:16,997 INFO L225 Difference]: With dead ends: 117 [2019-09-16 16:18:16,997 INFO L226 Difference]: Without dead ends: 81 [2019-09-16 16:18:16,998 INFO L636 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-16 16:18:16,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-16 16:18:17,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-09-16 16:18:17,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-16 16:18:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2019-09-16 16:18:17,009 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 22 [2019-09-16 16:18:17,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:17,009 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2019-09-16 16:18:17,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:17,010 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2019-09-16 16:18:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 16:18:17,011 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:17,011 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:17,011 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:17,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:17,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1794675624, now seen corresponding path program 1 times [2019-09-16 16:18:17,012 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:17,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:17,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:17,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:17,091 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-16 16:18:17,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:17,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:17,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:17,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:17,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:17,093 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 3 states. [2019-09-16 16:18:17,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:17,125 INFO L93 Difference]: Finished difference Result 148 states and 264 transitions. [2019-09-16 16:18:17,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:17,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-16 16:18:17,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:17,127 INFO L225 Difference]: With dead ends: 148 [2019-09-16 16:18:17,128 INFO L226 Difference]: Without dead ends: 146 [2019-09-16 16:18:17,128 INFO L636 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-16 16:18:17,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-16 16:18:17,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2019-09-16 16:18:17,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-16 16:18:17,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 184 transitions. [2019-09-16 16:18:17,142 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 184 transitions. Word has length 22 [2019-09-16 16:18:17,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:17,142 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 184 transitions. [2019-09-16 16:18:17,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:17,143 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 184 transitions. [2019-09-16 16:18:17,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 16:18:17,145 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:17,146 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:17,146 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:17,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:17,146 INFO L82 PathProgramCache]: Analyzing trace with hash 783558374, now seen corresponding path program 1 times [2019-09-16 16:18:17,147 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:17,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:17,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:17,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:17,184 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-16 16:18:17,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:17,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:17,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:17,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:17,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:17,186 INFO L87 Difference]: Start difference. First operand 104 states and 184 transitions. Second operand 3 states. [2019-09-16 16:18:17,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:17,208 INFO L93 Difference]: Finished difference Result 244 states and 438 transitions. [2019-09-16 16:18:17,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:17,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-16 16:18:17,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:17,211 INFO L225 Difference]: With dead ends: 244 [2019-09-16 16:18:17,211 INFO L226 Difference]: Without dead ends: 148 [2019-09-16 16:18:17,212 INFO L636 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-16 16:18:17,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-16 16:18:17,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2019-09-16 16:18:17,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-16 16:18:17,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 258 transitions. [2019-09-16 16:18:17,225 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 258 transitions. Word has length 22 [2019-09-16 16:18:17,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:17,225 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 258 transitions. [2019-09-16 16:18:17,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:17,226 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 258 transitions. [2019-09-16 16:18:17,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 16:18:17,227 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:17,227 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:17,227 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:17,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:17,228 INFO L82 PathProgramCache]: Analyzing trace with hash -199417107, now seen corresponding path program 1 times [2019-09-16 16:18:17,228 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:17,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:17,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:17,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:17,268 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-16 16:18:17,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:17,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:17,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:17,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:17,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:17,272 INFO L87 Difference]: Start difference. First operand 146 states and 258 transitions. Second operand 3 states. [2019-09-16 16:18:17,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:17,293 INFO L93 Difference]: Finished difference Result 219 states and 385 transitions. [2019-09-16 16:18:17,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:17,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 16:18:17,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:17,295 INFO L225 Difference]: With dead ends: 219 [2019-09-16 16:18:17,295 INFO L226 Difference]: Without dead ends: 150 [2019-09-16 16:18:17,296 INFO L636 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-16 16:18:17,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-16 16:18:17,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-09-16 16:18:17,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-16 16:18:17,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2019-09-16 16:18:17,307 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 258 transitions. Word has length 23 [2019-09-16 16:18:17,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:17,307 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 258 transitions. [2019-09-16 16:18:17,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:17,308 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 258 transitions. [2019-09-16 16:18:17,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 16:18:17,309 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:17,309 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:17,309 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:17,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:17,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1479280785, now seen corresponding path program 1 times [2019-09-16 16:18:17,310 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:17,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:17,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:17,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:17,354 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-16 16:18:17,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:17,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:17,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:17,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:17,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:17,356 INFO L87 Difference]: Start difference. First operand 148 states and 258 transitions. Second operand 3 states. [2019-09-16 16:18:17,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:17,379 INFO L93 Difference]: Finished difference Result 276 states and 488 transitions. [2019-09-16 16:18:17,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:17,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 16:18:17,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:17,383 INFO L225 Difference]: With dead ends: 276 [2019-09-16 16:18:17,384 INFO L226 Difference]: Without dead ends: 274 [2019-09-16 16:18:17,384 INFO L636 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-16 16:18:17,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-16 16:18:17,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 200. [2019-09-16 16:18:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-16 16:18:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 346 transitions. [2019-09-16 16:18:17,407 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 346 transitions. Word has length 23 [2019-09-16 16:18:17,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:17,408 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 346 transitions. [2019-09-16 16:18:17,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:17,408 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 346 transitions. [2019-09-16 16:18:17,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 16:18:17,410 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:17,410 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:17,411 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:17,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:17,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1804569261, now seen corresponding path program 1 times [2019-09-16 16:18:17,411 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:17,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:17,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:17,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:17,467 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-16 16:18:17,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:17,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:17,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:17,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:17,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:17,469 INFO L87 Difference]: Start difference. First operand 200 states and 346 transitions. Second operand 3 states. [2019-09-16 16:18:17,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:17,498 INFO L93 Difference]: Finished difference Result 472 states and 824 transitions. [2019-09-16 16:18:17,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:17,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 16:18:17,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:17,500 INFO L225 Difference]: With dead ends: 472 [2019-09-16 16:18:17,500 INFO L226 Difference]: Without dead ends: 282 [2019-09-16 16:18:17,501 INFO L636 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-16 16:18:17,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-16 16:18:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2019-09-16 16:18:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-16 16:18:17,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 482 transitions. [2019-09-16 16:18:17,529 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 482 transitions. Word has length 23 [2019-09-16 16:18:17,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:17,530 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 482 transitions. [2019-09-16 16:18:17,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:17,530 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 482 transitions. [2019-09-16 16:18:17,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 16:18:17,539 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:17,540 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:17,540 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:17,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:17,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1387149659, now seen corresponding path program 1 times [2019-09-16 16:18:17,541 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:17,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:17,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:17,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:17,579 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-16 16:18:17,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:17,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:17,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:17,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:17,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:17,580 INFO L87 Difference]: Start difference. First operand 280 states and 482 transitions. Second operand 3 states. [2019-09-16 16:18:17,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:17,601 INFO L93 Difference]: Finished difference Result 420 states and 720 transitions. [2019-09-16 16:18:17,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:17,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 16:18:17,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:17,604 INFO L225 Difference]: With dead ends: 420 [2019-09-16 16:18:17,604 INFO L226 Difference]: Without dead ends: 286 [2019-09-16 16:18:17,605 INFO L636 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-16 16:18:17,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-16 16:18:17,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2019-09-16 16:18:17,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-09-16 16:18:17,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 482 transitions. [2019-09-16 16:18:17,616 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 482 transitions. Word has length 24 [2019-09-16 16:18:17,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:17,616 INFO L475 AbstractCegarLoop]: Abstraction has 284 states and 482 transitions. [2019-09-16 16:18:17,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:17,617 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 482 transitions. [2019-09-16 16:18:17,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 16:18:17,618 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:17,618 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:17,618 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:17,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:17,618 INFO L82 PathProgramCache]: Analyzing trace with hash 107285981, now seen corresponding path program 1 times [2019-09-16 16:18:17,619 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:17,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:17,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:17,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:17,671 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-16 16:18:17,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:17,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:17,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:17,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:17,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:17,673 INFO L87 Difference]: Start difference. First operand 284 states and 482 transitions. Second operand 3 states. [2019-09-16 16:18:17,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:17,704 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2019-09-16 16:18:17,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:17,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 16:18:17,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:17,711 INFO L225 Difference]: With dead ends: 524 [2019-09-16 16:18:17,711 INFO L226 Difference]: Without dead ends: 522 [2019-09-16 16:18:17,712 INFO L636 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-16 16:18:17,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-09-16 16:18:17,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 392. [2019-09-16 16:18:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-16 16:18:17,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 654 transitions. [2019-09-16 16:18:17,730 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 654 transitions. Word has length 24 [2019-09-16 16:18:17,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:17,730 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 654 transitions. [2019-09-16 16:18:17,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:17,730 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 654 transitions. [2019-09-16 16:18:17,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 16:18:17,731 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:17,735 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:17,736 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:17,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:17,736 INFO L82 PathProgramCache]: Analyzing trace with hash -903831269, now seen corresponding path program 1 times [2019-09-16 16:18:17,738 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:17,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:17,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:17,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:17,776 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-16 16:18:17,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:17,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:17,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:17,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:17,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:17,778 INFO L87 Difference]: Start difference. First operand 392 states and 654 transitions. Second operand 3 states. [2019-09-16 16:18:17,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:17,812 INFO L93 Difference]: Finished difference Result 924 states and 1552 transitions. [2019-09-16 16:18:17,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:17,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 16:18:17,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:17,817 INFO L225 Difference]: With dead ends: 924 [2019-09-16 16:18:17,817 INFO L226 Difference]: Without dead ends: 546 [2019-09-16 16:18:17,819 INFO L636 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-16 16:18:17,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-09-16 16:18:17,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2019-09-16 16:18:17,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-09-16 16:18:17,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 902 transitions. [2019-09-16 16:18:17,842 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 902 transitions. Word has length 24 [2019-09-16 16:18:17,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:17,843 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 902 transitions. [2019-09-16 16:18:17,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:17,843 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 902 transitions. [2019-09-16 16:18:17,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 16:18:17,846 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:17,847 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:17,847 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:17,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:17,847 INFO L82 PathProgramCache]: Analyzing trace with hash -968887806, now seen corresponding path program 1 times [2019-09-16 16:18:17,847 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:17,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:17,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:17,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:17,886 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-16 16:18:17,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:17,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:17,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:17,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:17,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:17,889 INFO L87 Difference]: Start difference. First operand 544 states and 902 transitions. Second operand 3 states. [2019-09-16 16:18:17,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:17,912 INFO L93 Difference]: Finished difference Result 816 states and 1348 transitions. [2019-09-16 16:18:17,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:17,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 16:18:17,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:17,916 INFO L225 Difference]: With dead ends: 816 [2019-09-16 16:18:17,916 INFO L226 Difference]: Without dead ends: 554 [2019-09-16 16:18:17,917 INFO L636 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-16 16:18:17,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-09-16 16:18:17,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2019-09-16 16:18:17,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-09-16 16:18:17,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 902 transitions. [2019-09-16 16:18:17,935 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 902 transitions. Word has length 25 [2019-09-16 16:18:17,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:17,937 INFO L475 AbstractCegarLoop]: Abstraction has 552 states and 902 transitions. [2019-09-16 16:18:17,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:17,937 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 902 transitions. [2019-09-16 16:18:17,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 16:18:17,938 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:17,938 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:17,938 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:17,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:17,939 INFO L82 PathProgramCache]: Analyzing trace with hash 2046215812, now seen corresponding path program 1 times [2019-09-16 16:18:17,939 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:17,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:17,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:17,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:17,969 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-16 16:18:17,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:17,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:17,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:17,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:17,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:17,970 INFO L87 Difference]: Start difference. First operand 552 states and 902 transitions. Second operand 3 states. [2019-09-16 16:18:17,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:17,997 INFO L93 Difference]: Finished difference Result 1004 states and 1672 transitions. [2019-09-16 16:18:17,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:17,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 16:18:17,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:18,003 INFO L225 Difference]: With dead ends: 1004 [2019-09-16 16:18:18,003 INFO L226 Difference]: Without dead ends: 1002 [2019-09-16 16:18:18,004 INFO L636 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-16 16:18:18,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-09-16 16:18:18,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 776. [2019-09-16 16:18:18,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-09-16 16:18:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1238 transitions. [2019-09-16 16:18:18,027 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1238 transitions. Word has length 25 [2019-09-16 16:18:18,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:18,027 INFO L475 AbstractCegarLoop]: Abstraction has 776 states and 1238 transitions. [2019-09-16 16:18:18,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:18,028 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1238 transitions. [2019-09-16 16:18:18,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 16:18:18,029 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:18,029 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:18,029 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:18,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:18,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1035098562, now seen corresponding path program 1 times [2019-09-16 16:18:18,030 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:18,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:18,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:18,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:18,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:18,062 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-16 16:18:18,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:18,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:18,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:18,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:18,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:18,064 INFO L87 Difference]: Start difference. First operand 776 states and 1238 transitions. Second operand 3 states. [2019-09-16 16:18:18,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:18,093 INFO L93 Difference]: Finished difference Result 1820 states and 2920 transitions. [2019-09-16 16:18:18,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:18,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 16:18:18,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:18,101 INFO L225 Difference]: With dead ends: 1820 [2019-09-16 16:18:18,102 INFO L226 Difference]: Without dead ends: 1066 [2019-09-16 16:18:18,104 INFO L636 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-16 16:18:18,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-09-16 16:18:18,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1064. [2019-09-16 16:18:18,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2019-09-16 16:18:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1686 transitions. [2019-09-16 16:18:18,135 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1686 transitions. Word has length 25 [2019-09-16 16:18:18,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:18,136 INFO L475 AbstractCegarLoop]: Abstraction has 1064 states and 1686 transitions. [2019-09-16 16:18:18,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:18,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1686 transitions. [2019-09-16 16:18:18,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 16:18:18,138 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:18,138 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:18,138 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:18,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:18,139 INFO L82 PathProgramCache]: Analyzing trace with hash -991604848, now seen corresponding path program 1 times [2019-09-16 16:18:18,139 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:18,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:18,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:18,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:18,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:18,165 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-16 16:18:18,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:18,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:18,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:18,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:18,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:18,167 INFO L87 Difference]: Start difference. First operand 1064 states and 1686 transitions. Second operand 3 states. [2019-09-16 16:18:18,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:18,196 INFO L93 Difference]: Finished difference Result 1596 states and 2520 transitions. [2019-09-16 16:18:18,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:18,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-16 16:18:18,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:18,202 INFO L225 Difference]: With dead ends: 1596 [2019-09-16 16:18:18,202 INFO L226 Difference]: Without dead ends: 1082 [2019-09-16 16:18:18,206 INFO L636 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-16 16:18:18,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-16 16:18:18,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2019-09-16 16:18:18,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2019-09-16 16:18:18,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1686 transitions. [2019-09-16 16:18:18,243 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1686 transitions. Word has length 26 [2019-09-16 16:18:18,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:18,245 INFO L475 AbstractCegarLoop]: Abstraction has 1080 states and 1686 transitions. [2019-09-16 16:18:18,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:18,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1686 transitions. [2019-09-16 16:18:18,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 16:18:18,247 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:18,247 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:18,247 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:18,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:18,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2023498770, now seen corresponding path program 1 times [2019-09-16 16:18:18,248 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:18,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:18,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:18,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:18,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:18,295 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-16 16:18:18,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:18,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:18,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:18,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:18,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:18,298 INFO L87 Difference]: Start difference. First operand 1080 states and 1686 transitions. Second operand 3 states. [2019-09-16 16:18:18,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:18,344 INFO L93 Difference]: Finished difference Result 1932 states and 3080 transitions. [2019-09-16 16:18:18,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:18,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-16 16:18:18,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:18,353 INFO L225 Difference]: With dead ends: 1932 [2019-09-16 16:18:18,354 INFO L226 Difference]: Without dead ends: 1930 [2019-09-16 16:18:18,355 INFO L636 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-16 16:18:18,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-09-16 16:18:18,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1544. [2019-09-16 16:18:18,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-09-16 16:18:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2342 transitions. [2019-09-16 16:18:18,422 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2342 transitions. Word has length 26 [2019-09-16 16:18:18,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:18,422 INFO L475 AbstractCegarLoop]: Abstraction has 1544 states and 2342 transitions. [2019-09-16 16:18:18,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:18,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2342 transitions. [2019-09-16 16:18:18,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 16:18:18,427 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:18,428 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:18,428 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:18,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:18,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1012381520, now seen corresponding path program 1 times [2019-09-16 16:18:18,429 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:18,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:18,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:18,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:18,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:18,456 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-16 16:18:18,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:18,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:18,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:18,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:18,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:18,458 INFO L87 Difference]: Start difference. First operand 1544 states and 2342 transitions. Second operand 3 states. [2019-09-16 16:18:18,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:18,524 INFO L93 Difference]: Finished difference Result 3596 states and 5480 transitions. [2019-09-16 16:18:18,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:18,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-16 16:18:18,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:18,535 INFO L225 Difference]: With dead ends: 3596 [2019-09-16 16:18:18,536 INFO L226 Difference]: Without dead ends: 2090 [2019-09-16 16:18:18,540 INFO L636 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-16 16:18:18,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2019-09-16 16:18:18,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2019-09-16 16:18:18,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2019-09-16 16:18:18,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3142 transitions. [2019-09-16 16:18:18,615 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3142 transitions. Word has length 26 [2019-09-16 16:18:18,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:18,616 INFO L475 AbstractCegarLoop]: Abstraction has 2088 states and 3142 transitions. [2019-09-16 16:18:18,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:18,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3142 transitions. [2019-09-16 16:18:18,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 16:18:18,619 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:18,619 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:18,620 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:18,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:18,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1695832809, now seen corresponding path program 1 times [2019-09-16 16:18:18,620 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:18,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:18,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:18,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:18,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:18,639 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-16 16:18:18,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:18,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:18,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:18,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:18,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:18,641 INFO L87 Difference]: Start difference. First operand 2088 states and 3142 transitions. Second operand 3 states. [2019-09-16 16:18:18,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:18,684 INFO L93 Difference]: Finished difference Result 3132 states and 4696 transitions. [2019-09-16 16:18:18,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:18,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-16 16:18:18,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:18,694 INFO L225 Difference]: With dead ends: 3132 [2019-09-16 16:18:18,694 INFO L226 Difference]: Without dead ends: 2122 [2019-09-16 16:18:18,696 INFO L636 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-16 16:18:18,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2019-09-16 16:18:18,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2019-09-16 16:18:18,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2019-09-16 16:18:18,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3142 transitions. [2019-09-16 16:18:18,756 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3142 transitions. Word has length 27 [2019-09-16 16:18:18,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:18,756 INFO L475 AbstractCegarLoop]: Abstraction has 2120 states and 3142 transitions. [2019-09-16 16:18:18,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:18,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3142 transitions. [2019-09-16 16:18:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 16:18:18,759 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:18,759 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:18,760 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:18,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:18,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1319270809, now seen corresponding path program 1 times [2019-09-16 16:18:18,760 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:18,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:18,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:18,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:18,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:18,787 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-16 16:18:18,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:18,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:18,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:18,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:18,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:18,789 INFO L87 Difference]: Start difference. First operand 2120 states and 3142 transitions. Second operand 3 states. [2019-09-16 16:18:18,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:18,849 INFO L93 Difference]: Finished difference Result 3724 states and 5640 transitions. [2019-09-16 16:18:18,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:18,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-16 16:18:18,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:18,865 INFO L225 Difference]: With dead ends: 3724 [2019-09-16 16:18:18,865 INFO L226 Difference]: Without dead ends: 3722 [2019-09-16 16:18:18,867 INFO L636 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-16 16:18:18,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-09-16 16:18:18,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3080. [2019-09-16 16:18:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2019-09-16 16:18:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4422 transitions. [2019-09-16 16:18:18,987 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4422 transitions. Word has length 27 [2019-09-16 16:18:18,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:18,988 INFO L475 AbstractCegarLoop]: Abstraction has 3080 states and 4422 transitions. [2019-09-16 16:18:18,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4422 transitions. [2019-09-16 16:18:18,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 16:18:18,992 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:18,992 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:18,993 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:18,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:18,993 INFO L82 PathProgramCache]: Analyzing trace with hash 308153559, now seen corresponding path program 1 times [2019-09-16 16:18:18,993 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:18,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:18,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:18,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:18,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:19,014 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-16 16:18:19,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:19,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:19,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:19,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:19,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:19,015 INFO L87 Difference]: Start difference. First operand 3080 states and 4422 transitions. Second operand 3 states. [2019-09-16 16:18:19,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:19,085 INFO L93 Difference]: Finished difference Result 7116 states and 10248 transitions. [2019-09-16 16:18:19,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:19,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-16 16:18:19,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:19,105 INFO L225 Difference]: With dead ends: 7116 [2019-09-16 16:18:19,106 INFO L226 Difference]: Without dead ends: 4106 [2019-09-16 16:18:19,114 INFO L636 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-16 16:18:19,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2019-09-16 16:18:19,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4104. [2019-09-16 16:18:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2019-09-16 16:18:19,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 5830 transitions. [2019-09-16 16:18:19,272 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 5830 transitions. Word has length 27 [2019-09-16 16:18:19,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:19,272 INFO L475 AbstractCegarLoop]: Abstraction has 4104 states and 5830 transitions. [2019-09-16 16:18:19,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:19,273 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 5830 transitions. [2019-09-16 16:18:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 16:18:19,278 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:19,278 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:19,278 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:19,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:19,278 INFO L82 PathProgramCache]: Analyzing trace with hash -2052062779, now seen corresponding path program 1 times [2019-09-16 16:18:19,278 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:19,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:19,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:19,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:19,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:19,298 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-16 16:18:19,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:19,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:19,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:19,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:19,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:19,299 INFO L87 Difference]: Start difference. First operand 4104 states and 5830 transitions. Second operand 3 states. [2019-09-16 16:18:19,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:19,361 INFO L93 Difference]: Finished difference Result 6156 states and 8712 transitions. [2019-09-16 16:18:19,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:19,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-16 16:18:19,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:19,400 INFO L225 Difference]: With dead ends: 6156 [2019-09-16 16:18:19,400 INFO L226 Difference]: Without dead ends: 4170 [2019-09-16 16:18:19,405 INFO L636 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-16 16:18:19,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2019-09-16 16:18:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4168. [2019-09-16 16:18:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2019-09-16 16:18:19,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5830 transitions. [2019-09-16 16:18:19,521 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5830 transitions. Word has length 28 [2019-09-16 16:18:19,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:19,521 INFO L475 AbstractCegarLoop]: Abstraction has 4168 states and 5830 transitions. [2019-09-16 16:18:19,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:19,521 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5830 transitions. [2019-09-16 16:18:19,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 16:18:19,526 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:19,527 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:19,527 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:19,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:19,527 INFO L82 PathProgramCache]: Analyzing trace with hash 963040839, now seen corresponding path program 1 times [2019-09-16 16:18:19,527 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:19,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:19,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:19,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:19,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:19,548 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-16 16:18:19,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:19,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:19,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:19,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:19,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:19,549 INFO L87 Difference]: Start difference. First operand 4168 states and 5830 transitions. Second operand 3 states. [2019-09-16 16:18:19,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:19,678 INFO L93 Difference]: Finished difference Result 12108 states and 16712 transitions. [2019-09-16 16:18:19,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:19,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-16 16:18:19,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:19,696 INFO L225 Difference]: With dead ends: 12108 [2019-09-16 16:18:19,696 INFO L226 Difference]: Without dead ends: 8074 [2019-09-16 16:18:19,707 INFO L636 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-16 16:18:19,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2019-09-16 16:18:19,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2019-09-16 16:18:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2019-09-16 16:18:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10886 transitions. [2019-09-16 16:18:19,909 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10886 transitions. Word has length 28 [2019-09-16 16:18:19,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:19,909 INFO L475 AbstractCegarLoop]: Abstraction has 8072 states and 10886 transitions. [2019-09-16 16:18:19,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:19,909 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10886 transitions. [2019-09-16 16:18:19,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 16:18:19,919 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:19,919 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:19,919 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:19,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:19,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1974158089, now seen corresponding path program 1 times [2019-09-16 16:18:19,920 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:19,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:19,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:19,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:19,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:19,936 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-16 16:18:19,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:19,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:19,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:19,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:19,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:19,937 INFO L87 Difference]: Start difference. First operand 8072 states and 10886 transitions. Second operand 3 states. [2019-09-16 16:18:20,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:20,051 INFO L93 Difference]: Finished difference Result 9100 states and 12680 transitions. [2019-09-16 16:18:20,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:20,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-16 16:18:20,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:20,068 INFO L225 Difference]: With dead ends: 9100 [2019-09-16 16:18:20,068 INFO L226 Difference]: Without dead ends: 9098 [2019-09-16 16:18:20,072 INFO L636 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-16 16:18:20,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2019-09-16 16:18:20,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 8072. [2019-09-16 16:18:20,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2019-09-16 16:18:20,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10758 transitions. [2019-09-16 16:18:20,318 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10758 transitions. Word has length 28 [2019-09-16 16:18:20,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:20,318 INFO L475 AbstractCegarLoop]: Abstraction has 8072 states and 10758 transitions. [2019-09-16 16:18:20,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:20,319 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10758 transitions. [2019-09-16 16:18:20,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 16:18:20,328 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:20,328 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:20,328 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:20,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:20,328 INFO L82 PathProgramCache]: Analyzing trace with hash -210289620, now seen corresponding path program 1 times [2019-09-16 16:18:20,329 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:20,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:20,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:20,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:20,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:20,345 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-16 16:18:20,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:20,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:20,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:20,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:20,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:20,347 INFO L87 Difference]: Start difference. First operand 8072 states and 10758 transitions. Second operand 3 states. [2019-09-16 16:18:20,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:20,505 INFO L93 Difference]: Finished difference Result 13708 states and 18568 transitions. [2019-09-16 16:18:20,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:20,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-16 16:18:20,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:20,529 INFO L225 Difference]: With dead ends: 13708 [2019-09-16 16:18:20,530 INFO L226 Difference]: Without dead ends: 13706 [2019-09-16 16:18:20,535 INFO L636 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-16 16:18:20,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13706 states. [2019-09-16 16:18:20,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13706 to 12168. [2019-09-16 16:18:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2019-09-16 16:18:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 15750 transitions. [2019-09-16 16:18:20,911 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 15750 transitions. Word has length 29 [2019-09-16 16:18:20,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:20,911 INFO L475 AbstractCegarLoop]: Abstraction has 12168 states and 15750 transitions. [2019-09-16 16:18:20,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:20,911 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 15750 transitions. [2019-09-16 16:18:20,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 16:18:20,927 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:20,927 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:20,928 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:20,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:20,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1221406870, now seen corresponding path program 1 times [2019-09-16 16:18:20,928 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:20,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:20,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:20,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:20,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:20,944 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-16 16:18:20,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:20,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:20,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:20,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:20,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:20,946 INFO L87 Difference]: Start difference. First operand 12168 states and 15750 transitions. Second operand 3 states. [2019-09-16 16:18:21,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:21,135 INFO L93 Difference]: Finished difference Result 27788 states and 35976 transitions. [2019-09-16 16:18:21,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:21,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-16 16:18:21,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:21,165 INFO L225 Difference]: With dead ends: 27788 [2019-09-16 16:18:21,166 INFO L226 Difference]: Without dead ends: 15754 [2019-09-16 16:18:21,192 INFO L636 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-16 16:18:21,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15754 states. [2019-09-16 16:18:21,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15754 to 15752. [2019-09-16 16:18:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2019-09-16 16:18:21,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 19974 transitions. [2019-09-16 16:18:21,536 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 19974 transitions. Word has length 29 [2019-09-16 16:18:21,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:21,536 INFO L475 AbstractCegarLoop]: Abstraction has 15752 states and 19974 transitions. [2019-09-16 16:18:21,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:21,536 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 19974 transitions. [2019-09-16 16:18:21,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 16:18:21,556 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:21,557 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:21,557 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:21,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:21,557 INFO L82 PathProgramCache]: Analyzing trace with hash 2071172156, now seen corresponding path program 1 times [2019-09-16 16:18:21,557 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:21,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:21,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:21,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:21,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:21,577 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-16 16:18:21,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:21,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:21,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:21,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:21,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:21,883 INFO L87 Difference]: Start difference. First operand 15752 states and 19974 transitions. Second operand 3 states. [2019-09-16 16:18:22,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:22,045 INFO L93 Difference]: Finished difference Result 23820 states and 30216 transitions. [2019-09-16 16:18:22,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:22,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 16:18:22,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:22,073 INFO L225 Difference]: With dead ends: 23820 [2019-09-16 16:18:22,073 INFO L226 Difference]: Without dead ends: 16138 [2019-09-16 16:18:22,090 INFO L636 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-16 16:18:22,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16138 states. [2019-09-16 16:18:22,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16138 to 16136. [2019-09-16 16:18:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16136 states. [2019-09-16 16:18:22,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 20230 transitions. [2019-09-16 16:18:22,383 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 20230 transitions. Word has length 30 [2019-09-16 16:18:22,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:22,383 INFO L475 AbstractCegarLoop]: Abstraction has 16136 states and 20230 transitions. [2019-09-16 16:18:22,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:22,383 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 20230 transitions. [2019-09-16 16:18:22,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 16:18:22,401 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:22,401 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:22,401 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:22,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:22,402 INFO L82 PathProgramCache]: Analyzing trace with hash 791308478, now seen corresponding path program 1 times [2019-09-16 16:18:22,402 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:22,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:22,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:22,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:22,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:22,421 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-16 16:18:22,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:22,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:22,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:22,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:22,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:22,423 INFO L87 Difference]: Start difference. First operand 16136 states and 20230 transitions. Second operand 3 states. [2019-09-16 16:18:22,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:22,726 INFO L93 Difference]: Finished difference Result 26636 states and 33544 transitions. [2019-09-16 16:18:22,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:22,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 16:18:22,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:22,770 INFO L225 Difference]: With dead ends: 26636 [2019-09-16 16:18:22,770 INFO L226 Difference]: Without dead ends: 26634 [2019-09-16 16:18:22,776 INFO L636 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-16 16:18:22,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26634 states. [2019-09-16 16:18:23,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26634 to 24584. [2019-09-16 16:18:23,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24584 states. [2019-09-16 16:18:23,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24584 states to 24584 states and 29958 transitions. [2019-09-16 16:18:23,206 INFO L78 Accepts]: Start accepts. Automaton has 24584 states and 29958 transitions. Word has length 30 [2019-09-16 16:18:23,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:23,206 INFO L475 AbstractCegarLoop]: Abstraction has 24584 states and 29958 transitions. [2019-09-16 16:18:23,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:23,207 INFO L276 IsEmpty]: Start isEmpty. Operand 24584 states and 29958 transitions. [2019-09-16 16:18:23,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 16:18:23,248 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:23,248 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:23,248 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:23,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:23,249 INFO L82 PathProgramCache]: Analyzing trace with hash -219808772, now seen corresponding path program 1 times [2019-09-16 16:18:23,249 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:23,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:23,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:23,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:23,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:23,269 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-16 16:18:23,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:23,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:23,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:23,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:23,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:23,271 INFO L87 Difference]: Start difference. First operand 24584 states and 29958 transitions. Second operand 3 states. [2019-09-16 16:18:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:23,667 INFO L93 Difference]: Finished difference Result 55308 states and 66824 transitions. [2019-09-16 16:18:23,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:23,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 16:18:23,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:23,720 INFO L225 Difference]: With dead ends: 55308 [2019-09-16 16:18:23,720 INFO L226 Difference]: Without dead ends: 31242 [2019-09-16 16:18:23,766 INFO L636 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-16 16:18:23,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31242 states. [2019-09-16 16:18:24,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31242 to 31240. [2019-09-16 16:18:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31240 states. [2019-09-16 16:18:24,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31240 states to 31240 states and 36870 transitions. [2019-09-16 16:18:24,521 INFO L78 Accepts]: Start accepts. Automaton has 31240 states and 36870 transitions. Word has length 30 [2019-09-16 16:18:24,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:24,521 INFO L475 AbstractCegarLoop]: Abstraction has 31240 states and 36870 transitions. [2019-09-16 16:18:24,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 31240 states and 36870 transitions. [2019-09-16 16:18:24,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-16 16:18:24,549 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:24,549 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:24,550 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:24,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:24,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1239024833, now seen corresponding path program 1 times [2019-09-16 16:18:24,550 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:24,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:24,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:24,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:24,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:24,566 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-16 16:18:24,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:24,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:24,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:24,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:24,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:24,568 INFO L87 Difference]: Start difference. First operand 31240 states and 36870 transitions. Second operand 3 states. [2019-09-16 16:18:24,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:24,842 INFO L93 Difference]: Finished difference Result 46860 states and 55048 transitions. [2019-09-16 16:18:24,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:24,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-16 16:18:24,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:24,893 INFO L225 Difference]: With dead ends: 46860 [2019-09-16 16:18:24,894 INFO L226 Difference]: Without dead ends: 31754 [2019-09-16 16:18:24,923 INFO L636 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-16 16:18:24,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31754 states. [2019-09-16 16:18:26,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31754 to 31752. [2019-09-16 16:18:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31752 states. [2019-09-16 16:18:26,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31752 states to 31752 states and 36870 transitions. [2019-09-16 16:18:26,326 INFO L78 Accepts]: Start accepts. Automaton has 31752 states and 36870 transitions. Word has length 31 [2019-09-16 16:18:26,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:26,327 INFO L475 AbstractCegarLoop]: Abstraction has 31752 states and 36870 transitions. [2019-09-16 16:18:26,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:26,327 INFO L276 IsEmpty]: Start isEmpty. Operand 31752 states and 36870 transitions. [2019-09-16 16:18:26,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-16 16:18:26,343 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:26,343 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:26,343 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:26,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:26,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1776078785, now seen corresponding path program 1 times [2019-09-16 16:18:26,345 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:26,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:26,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:26,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:26,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:26,364 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-16 16:18:26,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:26,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:26,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:26,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:26,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:26,366 INFO L87 Difference]: Start difference. First operand 31752 states and 36870 transitions. Second operand 3 states. [2019-09-16 16:18:26,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:26,782 INFO L93 Difference]: Finished difference Result 51210 states and 58887 transitions. [2019-09-16 16:18:26,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:26,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-16 16:18:26,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:26,830 INFO L225 Difference]: With dead ends: 51210 [2019-09-16 16:18:26,830 INFO L226 Difference]: Without dead ends: 51208 [2019-09-16 16:18:26,847 INFO L636 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-16 16:18:26,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51208 states. [2019-09-16 16:18:27,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51208 to 49160. [2019-09-16 16:18:27,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49160 states. [2019-09-16 16:18:27,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49160 states to 49160 states and 55814 transitions. [2019-09-16 16:18:27,531 INFO L78 Accepts]: Start accepts. Automaton has 49160 states and 55814 transitions. Word has length 31 [2019-09-16 16:18:27,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:27,532 INFO L475 AbstractCegarLoop]: Abstraction has 49160 states and 55814 transitions. [2019-09-16 16:18:27,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:27,532 INFO L276 IsEmpty]: Start isEmpty. Operand 49160 states and 55814 transitions. [2019-09-16 16:18:27,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-16 16:18:27,560 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:27,561 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:27,561 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:27,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:27,561 INFO L82 PathProgramCache]: Analyzing trace with hash 764961535, now seen corresponding path program 1 times [2019-09-16 16:18:27,561 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:27,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:27,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:27,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:27,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:27,586 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-16 16:18:27,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:27,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:27,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:27,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:27,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:27,587 INFO L87 Difference]: Start difference. First operand 49160 states and 55814 transitions. Second operand 3 states. [2019-09-16 16:18:28,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:28,046 INFO L93 Difference]: Finished difference Result 109576 states and 122374 transitions. [2019-09-16 16:18:28,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:28,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-16 16:18:28,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:28,047 INFO L225 Difference]: With dead ends: 109576 [2019-09-16 16:18:28,047 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 16:18:28,141 INFO L636 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-16 16:18:28,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 16:18:28,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 16:18:28,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 16:18:28,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 16:18:28,142 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-09-16 16:18:28,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:28,143 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 16:18:28,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:28,143 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 16:18:28,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 16:18:28,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-16 16:18:28,323 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-16 16:18:28,323 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:18:28,323 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:18:28,323 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-16 16:18:28,323 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-16 16:18:28,324 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-16 16:18:28,324 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed. [2019-09-16 16:18:28,324 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-09-16 16:18:28,324 INFO L443 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2019-09-16 16:18:28,324 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-09-16 16:18:28,324 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-09-16 16:18:28,324 INFO L439 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2019-09-16 16:18:28,324 INFO L443 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2019-09-16 16:18:28,325 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2019-09-16 16:18:28,325 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2019-09-16 16:18:28,325 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2019-09-16 16:18:28,325 INFO L443 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2019-09-16 16:18:28,325 INFO L443 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2019-09-16 16:18:28,325 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2019-09-16 16:18:28,325 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-09-16 16:18:28,325 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2019-09-16 16:18:28,325 INFO L443 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2019-09-16 16:18:28,326 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed. [2019-09-16 16:18:28,326 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2019-09-16 16:18:28,326 INFO L443 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2019-09-16 16:18:28,326 INFO L443 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2019-09-16 16:18:28,327 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2019-09-16 16:18:28,327 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true [2019-09-16 16:18:28,327 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-09-16 16:18:28,327 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-09-16 16:18:28,327 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2019-09-16 16:18:28,328 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2019-09-16 16:18:28,328 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-09-16 16:18:28,328 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-09-16 16:18:28,328 INFO L446 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2019-09-16 16:18:28,328 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2019-09-16 16:18:28,328 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2019-09-16 16:18:28,328 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2019-09-16 16:18:28,328 INFO L443 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2019-09-16 16:18:28,328 INFO L443 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2019-09-16 16:18:28,328 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2019-09-16 16:18:28,329 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2019-09-16 16:18:28,329 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-09-16 16:18:28,329 INFO L443 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2019-09-16 16:18:28,329 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2019-09-16 16:18:28,329 INFO L443 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2019-09-16 16:18:28,329 INFO L446 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2019-09-16 16:18:28,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 04:18:28 BoogieIcfgContainer [2019-09-16 16:18:28,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 16:18:28,344 INFO L168 Benchmark]: Toolchain (without parser) took 12850.75 ms. Allocated memory was 140.5 MB in the beginning and 1.1 GB in the end (delta: 943.7 MB). Free memory was 87.8 MB in the beginning and 851.4 MB in the end (delta: -763.6 MB). Peak memory consumption was 877.4 MB. Max. memory is 7.1 GB. [2019-09-16 16:18:28,346 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 140.5 MB. Free memory was 106.6 MB in the beginning and 106.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 16:18:28,350 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.34 ms. Allocated memory was 140.5 MB in the beginning and 198.7 MB in the end (delta: 58.2 MB). Free memory was 87.6 MB in the beginning and 176.0 MB in the end (delta: -88.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-09-16 16:18:28,351 INFO L168 Benchmark]: Boogie Preprocessor took 33.64 ms. Allocated memory is still 198.7 MB. Free memory was 176.0 MB in the beginning and 173.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-09-16 16:18:28,352 INFO L168 Benchmark]: RCFGBuilder took 327.70 ms. Allocated memory is still 198.7 MB. Free memory was 173.6 MB in the beginning and 154.1 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2019-09-16 16:18:28,353 INFO L168 Benchmark]: TraceAbstraction took 12113.29 ms. Allocated memory was 198.7 MB in the beginning and 1.1 GB in the end (delta: 885.5 MB). Free memory was 154.1 MB in the beginning and 851.4 MB in the end (delta: -697.3 MB). Peak memory consumption was 885.4 MB. Max. memory is 7.1 GB. [2019-09-16 16:18:28,364 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42 ms. Allocated memory is still 140.5 MB. Free memory was 106.6 MB in the beginning and 106.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 372.34 ms. Allocated memory was 140.5 MB in the beginning and 198.7 MB in the end (delta: 58.2 MB). Free memory was 87.6 MB in the beginning and 176.0 MB in the end (delta: -88.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.64 ms. Allocated memory is still 198.7 MB. Free memory was 176.0 MB in the beginning and 173.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 327.70 ms. Allocated memory is still 198.7 MB. Free memory was 173.6 MB in the beginning and 154.1 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12113.29 ms. Allocated memory was 198.7 MB in the beginning and 1.1 GB in the end (delta: 885.5 MB). Free memory was 154.1 MB in the beginning and 851.4 MB in the end (delta: -697.3 MB). Peak memory consumption was 885.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. SAFE Result, 12.0s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 2877 SDtfs, 1405 SDslu, 1967 SDs, 0 SdLazy, 165 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49160occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 8224 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 2058 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 777 ConstructedInterpolants, 0 QuantifiedInterpolants, 39912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...