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_10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 16:18:14,317 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:18:14,319 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:18:14,331 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:18:14,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:18:14,332 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:18:14,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:18:14,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:18:14,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:18:14,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:18:14,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:18:14,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:18:14,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:18:14,341 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:18:14,342 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:18:14,343 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:18:14,344 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:18:14,345 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:18:14,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:18:14,349 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:18:14,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:18:14,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:18:14,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:18:14,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:18:14,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:18:14,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:18:14,356 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:18:14,357 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:18:14,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:18:14,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:18:14,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:18:14,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:18:14,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:18:14,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:18:14,363 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:18:14,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:18:14,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:18:14,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:18:14,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:18:14,365 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:18:14,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:18:14,367 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,381 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:18:14,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:18:14,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:18:14,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:18:14,383 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:18:14,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:18:14,384 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:18:14,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:18:14,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:18:14,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:18:14,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:18:14,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:18:14,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:18:14,385 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:18:14,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:18:14,385 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:18:14,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:18:14,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:18:14,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:18:14,386 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:18:14,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:18:14,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:18:14,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:18:14,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:18:14,387 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:18:14,387 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:18:14,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:18:14,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:18:14,388 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:18:14,418 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:18:14,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:18:14,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:18:14,436 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:18:14,436 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:18:14,437 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2019-09-16 16:18:14,495 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b3a38520/eeec91a363234a77bef280f3f4f7e02c/FLAGe1eb46803 [2019-09-16 16:18:14,940 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:18:14,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2019-09-16 16:18:14,950 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b3a38520/eeec91a363234a77bef280f3f4f7e02c/FLAGe1eb46803 [2019-09-16 16:18:15,320 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b3a38520/eeec91a363234a77bef280f3f4f7e02c [2019-09-16 16:18:15,332 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:18:15,333 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:18:15,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:18:15,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:18:15,338 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:18:15,339 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,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7065b5cd 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,342 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,349 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:18:15,371 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:18:15,585 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:18:15,591 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:18:15,619 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:18:15,719 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:18:15,720 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,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:18:15,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:18:15,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:18:15,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:18:15,732 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,732 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,738 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,738 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,743 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,750 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,752 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,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:18:15,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:18:15,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:18:15,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:18:15,757 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,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:18:15,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:18:15,806 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:18:15,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:18:15,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 16:18:15,807 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:18:15,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:18:15,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:18:16,052 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:18:16,053 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 16:18:16,054 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,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:18:16,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:18:16,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:18:16,058 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:18:16,059 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,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d064aae 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,060 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,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d064aae 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,060 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,062 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2019-09-16 16:18:16,072 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:18:16,081 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 16:18:16,129 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 16:18:16,180 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:18:16,181 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:18:16,182 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:18:16,182 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:18:16,182 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:18:16,182 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:18:16,182 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:18:16,182 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:18:16,183 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:18:16,202 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-09-16 16:18:16,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 16:18:16,209 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:16,210 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] [2019-09-16 16:18:16,212 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:16,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:16,218 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2019-09-16 16:18:16,220 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:16,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:16,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:16,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:16,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:16,399 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,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:16,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:16,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:16,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:16,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:16,423 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-09-16 16:18:16,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:16,483 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2019-09-16 16:18:16,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:16,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-16 16:18:16,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:16,497 INFO L225 Difference]: With dead ends: 87 [2019-09-16 16:18:16,497 INFO L226 Difference]: Without dead ends: 72 [2019-09-16 16:18:16,500 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,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-16 16:18:16,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-09-16 16:18:16,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-16 16:18:16,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2019-09-16 16:18:16,542 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2019-09-16 16:18:16,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:16,542 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2019-09-16 16:18:16,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:16,543 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2019-09-16 16:18:16,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 16:18:16,544 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:16,544 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] [2019-09-16 16:18:16,545 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:16,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:16,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2019-09-16 16:18:16,546 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:16,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:16,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:16,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:16,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:16,608 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,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:16,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:16,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:16,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:16,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:16,611 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2019-09-16 16:18:16,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:16,641 INFO L93 Difference]: Finished difference Result 117 states and 212 transitions. [2019-09-16 16:18:16,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:16,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-16 16:18:16,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:16,644 INFO L225 Difference]: With dead ends: 117 [2019-09-16 16:18:16,644 INFO L226 Difference]: Without dead ends: 72 [2019-09-16 16:18:16,646 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,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-16 16:18:16,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-09-16 16:18:16,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-16 16:18:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2019-09-16 16:18:16,660 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2019-09-16 16:18:16,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:16,662 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2019-09-16 16:18:16,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:16,663 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2019-09-16 16:18:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 16:18:16,664 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:16,664 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,664 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:16,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:16,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2019-09-16 16:18:16,665 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:16,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:16,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:16,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:16,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:16,744 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,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:16,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:16,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:16,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:16,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:16,746 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2019-09-16 16:18:16,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:16,776 INFO L93 Difference]: Finished difference Result 108 states and 189 transitions. [2019-09-16 16:18:16,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:16,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-16 16:18:16,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:16,779 INFO L225 Difference]: With dead ends: 108 [2019-09-16 16:18:16,779 INFO L226 Difference]: Without dead ends: 75 [2019-09-16 16:18:16,780 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,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-16 16:18:16,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-09-16 16:18:16,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-16 16:18:16,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2019-09-16 16:18:16,798 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2019-09-16 16:18:16,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:16,799 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2019-09-16 16:18:16,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:16,799 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2019-09-16 16:18:16,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 16:18:16,800 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:16,801 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,801 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:16,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:16,801 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2019-09-16 16:18:16,801 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:16,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:16,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:16,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:16,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:16,851 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,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:16,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:16,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:16,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:16,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:16,853 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2019-09-16 16:18:16,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:16,898 INFO L93 Difference]: Finished difference Result 136 states and 240 transitions. [2019-09-16 16:18:16,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:16,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-16 16:18:16,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:16,901 INFO L225 Difference]: With dead ends: 136 [2019-09-16 16:18:16,901 INFO L226 Difference]: Without dead ends: 134 [2019-09-16 16:18:16,902 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,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-16 16:18:16,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2019-09-16 16:18:16,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-16 16:18:16,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2019-09-16 16:18:16,914 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2019-09-16 16:18:16,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:16,914 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2019-09-16 16:18:16,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:16,914 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2019-09-16 16:18:16,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 16:18:16,915 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:16,916 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,916 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:16,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:16,916 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2019-09-16 16:18:16,917 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:16,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:16,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:16,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:16,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:16,979 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,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:16,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:16,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:16,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:16,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:16,981 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2019-09-16 16:18:17,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:17,013 INFO L93 Difference]: Finished difference Result 224 states and 398 transitions. [2019-09-16 16:18:17,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:17,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-16 16:18:17,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:17,015 INFO L225 Difference]: With dead ends: 224 [2019-09-16 16:18:17,016 INFO L226 Difference]: Without dead ends: 136 [2019-09-16 16:18:17,017 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,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-16 16:18:17,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2019-09-16 16:18:17,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-16 16:18:17,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2019-09-16 16:18:17,030 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2019-09-16 16:18:17,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:17,030 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2019-09-16 16:18:17,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:17,031 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2019-09-16 16:18:17,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 16:18:17,032 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:17,032 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,033 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:17,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:17,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2019-09-16 16:18:17,033 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:17,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:17,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:17,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:17,072 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,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:17,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:17,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:17,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:17,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:17,073 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2019-09-16 16:18:17,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:17,090 INFO L93 Difference]: Finished difference Result 201 states and 349 transitions. [2019-09-16 16:18:17,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:17,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-16 16:18:17,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:17,092 INFO L225 Difference]: With dead ends: 201 [2019-09-16 16:18:17,092 INFO L226 Difference]: Without dead ends: 138 [2019-09-16 16:18:17,093 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,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-16 16:18:17,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-09-16 16:18:17,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-16 16:18:17,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2019-09-16 16:18:17,105 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2019-09-16 16:18:17,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:17,106 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2019-09-16 16:18:17,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:17,106 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2019-09-16 16:18:17,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 16:18:17,107 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:17,108 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,108 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:17,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:17,108 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2019-09-16 16:18:17,109 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:17,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:17,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:17,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:17,156 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,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:17,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:17,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:17,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:17,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:17,157 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2019-09-16 16:18:17,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:17,188 INFO L93 Difference]: Finished difference Result 252 states and 440 transitions. [2019-09-16 16:18:17,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:17,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-16 16:18:17,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:17,194 INFO L225 Difference]: With dead ends: 252 [2019-09-16 16:18:17,194 INFO L226 Difference]: Without dead ends: 250 [2019-09-16 16:18:17,195 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,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-16 16:18:17,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2019-09-16 16:18:17,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-16 16:18:17,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2019-09-16 16:18:17,222 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2019-09-16 16:18:17,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:17,226 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2019-09-16 16:18:17,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:17,226 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2019-09-16 16:18:17,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 16:18:17,228 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:17,228 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,229 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:17,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:17,231 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2019-09-16 16:18:17,231 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:17,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:17,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:17,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:17,259 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,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:17,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:17,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:17,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:17,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:17,260 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2019-09-16 16:18:17,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:17,291 INFO L93 Difference]: Finished difference Result 432 states and 744 transitions. [2019-09-16 16:18:17,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:17,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-16 16:18:17,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:17,294 INFO L225 Difference]: With dead ends: 432 [2019-09-16 16:18:17,294 INFO L226 Difference]: Without dead ends: 258 [2019-09-16 16:18:17,295 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 258 states. [2019-09-16 16:18:17,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-09-16 16:18:17,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-16 16:18:17,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2019-09-16 16:18:17,325 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2019-09-16 16:18:17,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:17,325 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2019-09-16 16:18:17,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:17,326 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2019-09-16 16:18:17,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 16:18:17,327 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:17,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] [2019-09-16 16:18:17,328 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:17,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:17,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2019-09-16 16:18:17,328 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:17,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:17,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:17,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:17,365 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,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:17,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:17,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:17,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:17,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:17,367 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2019-09-16 16:18:17,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:17,385 INFO L93 Difference]: Finished difference Result 384 states and 648 transitions. [2019-09-16 16:18:17,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:17,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 16:18:17,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:17,388 INFO L225 Difference]: With dead ends: 384 [2019-09-16 16:18:17,388 INFO L226 Difference]: Without dead ends: 262 [2019-09-16 16:18:17,389 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 262 states. [2019-09-16 16:18:17,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-09-16 16:18:17,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 16:18:17,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2019-09-16 16:18:17,399 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2019-09-16 16:18:17,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:17,400 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2019-09-16 16:18:17,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:17,400 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2019-09-16 16:18:17,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 16:18:17,401 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:17,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] [2019-09-16 16:18:17,402 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:17,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:17,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2019-09-16 16:18:17,402 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:17,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:17,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:17,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:17,430 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,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:17,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:17,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:17,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:17,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:17,432 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2019-09-16 16:18:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:17,457 INFO L93 Difference]: Finished difference Result 476 states and 808 transitions. [2019-09-16 16:18:17,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:17,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 16:18:17,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:17,460 INFO L225 Difference]: With dead ends: 476 [2019-09-16 16:18:17,460 INFO L226 Difference]: Without dead ends: 474 [2019-09-16 16:18:17,461 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,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-09-16 16:18:17,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2019-09-16 16:18:17,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-16 16:18:17,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2019-09-16 16:18:17,474 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2019-09-16 16:18:17,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:17,474 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2019-09-16 16:18:17,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:17,474 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2019-09-16 16:18:17,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 16:18:17,476 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:17,476 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,476 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:17,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:17,477 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2019-09-16 16:18:17,477 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:17,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:17,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:17,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:17,501 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,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:17,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:17,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:17,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:17,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:17,502 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2019-09-16 16:18:17,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:17,537 INFO L93 Difference]: Finished difference Result 844 states and 1392 transitions. [2019-09-16 16:18:17,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:17,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 16:18:17,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:17,541 INFO L225 Difference]: With dead ends: 844 [2019-09-16 16:18:17,541 INFO L226 Difference]: Without dead ends: 498 [2019-09-16 16:18:17,544 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,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-09-16 16:18:17,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2019-09-16 16:18:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-09-16 16:18:17,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2019-09-16 16:18:17,560 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2019-09-16 16:18:17,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:17,561 INFO L475 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2019-09-16 16:18:17,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:17,561 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2019-09-16 16:18:17,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 16:18:17,562 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:17,562 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,563 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:17,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:17,563 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2019-09-16 16:18:17,563 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:17,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:17,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:17,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:17,584 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,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:17,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:17,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:17,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:17,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:17,586 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2019-09-16 16:18:17,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:17,609 INFO L93 Difference]: Finished difference Result 744 states and 1204 transitions. [2019-09-16 16:18:17,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:17,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 16:18:17,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:17,613 INFO L225 Difference]: With dead ends: 744 [2019-09-16 16:18:17,614 INFO L226 Difference]: Without dead ends: 506 [2019-09-16 16:18:17,615 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,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-09-16 16:18:17,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2019-09-16 16:18:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-16 16:18:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2019-09-16 16:18:17,631 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2019-09-16 16:18:17,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:17,632 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2019-09-16 16:18:17,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:17,632 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2019-09-16 16:18:17,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 16:18:17,633 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:17,634 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,634 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:17,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:17,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2019-09-16 16:18:17,635 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:17,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:17,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:17,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:17,667 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,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:17,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:17,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:17,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:17,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:17,669 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2019-09-16 16:18:17,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:17,698 INFO L93 Difference]: Finished difference Result 908 states and 1480 transitions. [2019-09-16 16:18:17,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:17,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 16:18:17,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:17,704 INFO L225 Difference]: With dead ends: 908 [2019-09-16 16:18:17,704 INFO L226 Difference]: Without dead ends: 906 [2019-09-16 16:18:17,705 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,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-09-16 16:18:17,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2019-09-16 16:18:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-09-16 16:18:17,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2019-09-16 16:18:17,732 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2019-09-16 16:18:17,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:17,734 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2019-09-16 16:18:17,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2019-09-16 16:18:17,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 16:18:17,735 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:17,736 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 14 === [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 -1591793729, now seen corresponding path program 1 times [2019-09-16 16:18:17,736 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:17,737 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,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:17,766 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,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:17,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:17,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:17,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:17,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:17,767 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2019-09-16 16:18:17,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:17,798 INFO L93 Difference]: Finished difference Result 1660 states and 2600 transitions. [2019-09-16 16:18:17,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:17,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 16:18:17,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:17,804 INFO L225 Difference]: With dead ends: 1660 [2019-09-16 16:18:17,805 INFO L226 Difference]: Without dead ends: 970 [2019-09-16 16:18:17,809 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,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-09-16 16:18:17,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2019-09-16 16:18:17,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-09-16 16:18:17,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2019-09-16 16:18:17,838 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2019-09-16 16:18:17,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:17,839 INFO L475 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2019-09-16 16:18:17,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:17,839 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2019-09-16 16:18:17,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 16:18:17,841 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:17,841 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,841 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:17,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:17,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2019-09-16 16:18:17,842 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:17,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:17,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:17,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:17,866 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,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:17,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:17,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:17,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:17,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:17,868 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2019-09-16 16:18:17,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:17,899 INFO L93 Difference]: Finished difference Result 1452 states and 2232 transitions. [2019-09-16 16:18:17,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:17,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 16:18:17,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:17,905 INFO L225 Difference]: With dead ends: 1452 [2019-09-16 16:18:17,905 INFO L226 Difference]: Without dead ends: 986 [2019-09-16 16:18:17,908 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,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2019-09-16 16:18:17,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2019-09-16 16:18:17,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-09-16 16:18:17,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2019-09-16 16:18:17,940 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2019-09-16 16:18:17,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:17,941 INFO L475 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2019-09-16 16:18:17,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:17,941 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2019-09-16 16:18:17,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 16:18:17,943 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:17,943 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,943 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:17,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:17,944 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2019-09-16 16:18:17,944 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:17,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:17,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:17,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:17,979 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,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:17,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:17,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:17,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:17,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:17,981 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2019-09-16 16:18:18,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:18,022 INFO L93 Difference]: Finished difference Result 1740 states and 2696 transitions. [2019-09-16 16:18:18,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:18,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 16:18:18,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:18,031 INFO L225 Difference]: With dead ends: 1740 [2019-09-16 16:18:18,031 INFO L226 Difference]: Without dead ends: 1738 [2019-09-16 16:18:18,032 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,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-09-16 16:18:18,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2019-09-16 16:18:18,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2019-09-16 16:18:18,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2019-09-16 16:18:18,086 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2019-09-16 16:18:18,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:18,086 INFO L475 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2019-09-16 16:18:18,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:18,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2019-09-16 16:18:18,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 16:18:18,089 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:18,089 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,090 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:18,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:18,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2019-09-16 16:18:18,090 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:18,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:18,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:18,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:18,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:18,120 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,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:18,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:18,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:18,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:18,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:18,123 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2019-09-16 16:18:18,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:18,165 INFO L93 Difference]: Finished difference Result 3276 states and 4840 transitions. [2019-09-16 16:18:18,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:18,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 16:18:18,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:18,174 INFO L225 Difference]: With dead ends: 3276 [2019-09-16 16:18:18,174 INFO L226 Difference]: Without dead ends: 1898 [2019-09-16 16:18:18,177 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,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2019-09-16 16:18:18,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2019-09-16 16:18:18,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-09-16 16:18:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2019-09-16 16:18:18,233 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2019-09-16 16:18:18,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:18,234 INFO L475 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2019-09-16 16:18:18,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:18,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2019-09-16 16:18:18,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 16:18:18,237 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:18,237 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,237 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:18,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:18,238 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2019-09-16 16:18:18,238 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:18,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:18,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:18,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:18,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:18,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:18,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:18,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:18,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:18,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:18,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:18,269 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2019-09-16 16:18:18,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:18,323 INFO L93 Difference]: Finished difference Result 2844 states and 4120 transitions. [2019-09-16 16:18:18,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:18,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-16 16:18:18,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:18,334 INFO L225 Difference]: With dead ends: 2844 [2019-09-16 16:18:18,334 INFO L226 Difference]: Without dead ends: 1930 [2019-09-16 16:18:18,337 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,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-09-16 16:18:18,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2019-09-16 16:18:18,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-09-16 16:18:18,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2019-09-16 16:18:18,418 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2019-09-16 16:18:18,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:18,419 INFO L475 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2019-09-16 16:18:18,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:18,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2019-09-16 16:18:18,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 16:18:18,422 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:18,422 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,422 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:18,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:18,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2019-09-16 16:18:18,423 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:18,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:18,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:18,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:18,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:18,448 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,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:18,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:18,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:18,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:18,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:18,450 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2019-09-16 16:18:18,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:18,529 INFO L93 Difference]: Finished difference Result 3340 states and 4872 transitions. [2019-09-16 16:18:18,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:18,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-16 16:18:18,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:18,550 INFO L225 Difference]: With dead ends: 3340 [2019-09-16 16:18:18,551 INFO L226 Difference]: Without dead ends: 3338 [2019-09-16 16:18:18,553 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,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2019-09-16 16:18:18,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2019-09-16 16:18:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2019-09-16 16:18:18,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2019-09-16 16:18:18,655 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2019-09-16 16:18:18,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:18,655 INFO L475 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2019-09-16 16:18:18,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:18,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2019-09-16 16:18:18,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 16:18:18,660 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:18,661 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,661 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:18,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:18,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2019-09-16 16:18:18,661 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:18,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:18,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:18,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:18,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:18,677 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,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:18,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:18,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:18,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:18,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:18,678 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2019-09-16 16:18:18,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:18,758 INFO L93 Difference]: Finished difference Result 6476 states and 8968 transitions. [2019-09-16 16:18:18,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:18,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-16 16:18:18,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:18,776 INFO L225 Difference]: With dead ends: 6476 [2019-09-16 16:18:18,776 INFO L226 Difference]: Without dead ends: 3722 [2019-09-16 16:18:18,783 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,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-09-16 16:18:18,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2019-09-16 16:18:18,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2019-09-16 16:18:18,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2019-09-16 16:18:18,920 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2019-09-16 16:18:18,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:18,920 INFO L475 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2019-09-16 16:18:18,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:18,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2019-09-16 16:18:18,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 16:18:18,926 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:18,926 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,926 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:18,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:18,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2019-09-16 16:18:18,927 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:18,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:18,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:18,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:18,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:18,947 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,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:18,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:18,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:18,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:18,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:18,949 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2019-09-16 16:18:19,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:19,017 INFO L93 Difference]: Finished difference Result 5580 states and 7560 transitions. [2019-09-16 16:18:19,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:19,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-16 16:18:19,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:19,033 INFO L225 Difference]: With dead ends: 5580 [2019-09-16 16:18:19,033 INFO L226 Difference]: Without dead ends: 3786 [2019-09-16 16:18:19,037 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,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-09-16 16:18:19,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-09-16 16:18:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-09-16 16:18:19,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2019-09-16 16:18:19,149 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2019-09-16 16:18:19,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:19,150 INFO L475 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2019-09-16 16:18:19,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:19,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2019-09-16 16:18:19,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 16:18:19,156 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:19,156 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:19,157 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:19,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:19,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2019-09-16 16:18:19,157 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:19,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:19,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:19,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:19,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:19,179 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,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:19,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:19,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:19,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:19,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:19,181 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2019-09-16 16:18:19,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:19,299 INFO L93 Difference]: Finished difference Result 10956 states and 14408 transitions. [2019-09-16 16:18:19,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:19,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-16 16:18:19,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:19,341 INFO L225 Difference]: With dead ends: 10956 [2019-09-16 16:18:19,341 INFO L226 Difference]: Without dead ends: 7306 [2019-09-16 16:18:19,350 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,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2019-09-16 16:18:19,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2019-09-16 16:18:19,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2019-09-16 16:18:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2019-09-16 16:18:19,580 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2019-09-16 16:18:19,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:19,580 INFO L475 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2019-09-16 16:18:19,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:19,580 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2019-09-16 16:18:19,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 16:18:19,592 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:19,592 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:19,592 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:19,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:19,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2019-09-16 16:18:19,593 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:19,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:19,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:19,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:19,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:19,617 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,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:19,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:19,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:19,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:19,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:19,620 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2019-09-16 16:18:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:19,760 INFO L93 Difference]: Finished difference Result 8076 states and 10632 transitions. [2019-09-16 16:18:19,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:19,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-16 16:18:19,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:19,775 INFO L225 Difference]: With dead ends: 8076 [2019-09-16 16:18:19,775 INFO L226 Difference]: Without dead ends: 8074 [2019-09-16 16:18:19,778 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,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2019-09-16 16:18:19,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2019-09-16 16:18:19,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2019-09-16 16:18:19,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2019-09-16 16:18:19,982 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2019-09-16 16:18:19,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:19,982 INFO L475 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2019-09-16 16:18:19,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:19,982 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2019-09-16 16:18:19,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 16:18:19,993 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:19,993 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,993 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:19,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:19,994 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2019-09-16 16:18:19,994 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:19,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:19,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:19,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:19,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:20,015 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,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:20,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:20,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:20,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:20,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:20,017 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2019-09-16 16:18:20,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:20,230 INFO L93 Difference]: Finished difference Result 12172 states and 15496 transitions. [2019-09-16 16:18:20,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:20,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-16 16:18:20,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:20,251 INFO L225 Difference]: With dead ends: 12172 [2019-09-16 16:18:20,251 INFO L226 Difference]: Without dead ends: 12170 [2019-09-16 16:18:20,257 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,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2019-09-16 16:18:20,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2019-09-16 16:18:20,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2019-09-16 16:18:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2019-09-16 16:18:20,497 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2019-09-16 16:18:20,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:20,497 INFO L475 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2019-09-16 16:18:20,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:20,498 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2019-09-16 16:18:20,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 16:18:20,515 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:20,515 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:20,515 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:20,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:20,515 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2019-09-16 16:18:20,516 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:20,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:20,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:20,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:20,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:20,537 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,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:20,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:20,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:20,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:20,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:20,538 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2019-09-16 16:18:20,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:20,727 INFO L93 Difference]: Finished difference Result 25228 states and 30856 transitions. [2019-09-16 16:18:20,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:20,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-16 16:18:20,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:20,752 INFO L225 Difference]: With dead ends: 25228 [2019-09-16 16:18:20,753 INFO L226 Difference]: Without dead ends: 14218 [2019-09-16 16:18:20,775 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,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2019-09-16 16:18:21,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2019-09-16 16:18:21,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-09-16 16:18:21,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 16902 transitions. [2019-09-16 16:18:21,266 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 16902 transitions. Word has length 28 [2019-09-16 16:18:21,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:21,267 INFO L475 AbstractCegarLoop]: Abstraction has 14216 states and 16902 transitions. [2019-09-16 16:18:21,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:21,267 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 16902 transitions. [2019-09-16 16:18:21,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 16:18:21,294 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:21,295 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:21,295 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:21,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:21,295 INFO L82 PathProgramCache]: Analyzing trace with hash 690414627, now seen corresponding path program 1 times [2019-09-16 16:18:21,296 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:21,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:21,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:21,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:21,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:21,315 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,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:21,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:21,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:21,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:21,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:21,317 INFO L87 Difference]: Start difference. First operand 14216 states and 16902 transitions. Second operand 3 states. [2019-09-16 16:18:21,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:21,585 INFO L93 Difference]: Finished difference Result 21516 states and 25608 transitions. [2019-09-16 16:18:21,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:21,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-16 16:18:21,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:21,624 INFO L225 Difference]: With dead ends: 21516 [2019-09-16 16:18:21,625 INFO L226 Difference]: Without dead ends: 14602 [2019-09-16 16:18:21,646 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,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2019-09-16 16:18:22,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14600. [2019-09-16 16:18:22,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2019-09-16 16:18:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 17158 transitions. [2019-09-16 16:18:22,338 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 17158 transitions. Word has length 29 [2019-09-16 16:18:22,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:22,339 INFO L475 AbstractCegarLoop]: Abstraction has 14600 states and 17158 transitions. [2019-09-16 16:18:22,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 17158 transitions. [2019-09-16 16:18:22,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 16:18:22,358 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:22,358 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:22,359 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:22,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:22,359 INFO L82 PathProgramCache]: Analyzing trace with hash -320702623, now seen corresponding path program 1 times [2019-09-16 16:18:22,359 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:22,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:22,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:22,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:22,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:22,381 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,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:22,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:22,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:22,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:22,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:22,382 INFO L87 Difference]: Start difference. First operand 14600 states and 17158 transitions. Second operand 3 states. [2019-09-16 16:18:22,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:22,668 INFO L93 Difference]: Finished difference Result 23562 states and 27399 transitions. [2019-09-16 16:18:22,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:22,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-16 16:18:22,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:22,707 INFO L225 Difference]: With dead ends: 23562 [2019-09-16 16:18:22,707 INFO L226 Difference]: Without dead ends: 23560 [2019-09-16 16:18:22,716 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,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2019-09-16 16:18:23,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 22536. [2019-09-16 16:18:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22536 states. [2019-09-16 16:18:23,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22536 states to 22536 states and 25862 transitions. [2019-09-16 16:18:23,593 INFO L78 Accepts]: Start accepts. Automaton has 22536 states and 25862 transitions. Word has length 29 [2019-09-16 16:18:23,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:23,593 INFO L475 AbstractCegarLoop]: Abstraction has 22536 states and 25862 transitions. [2019-09-16 16:18:23,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:23,594 INFO L276 IsEmpty]: Start isEmpty. Operand 22536 states and 25862 transitions. [2019-09-16 16:18:23,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 16:18:23,626 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:23,626 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:23,627 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:23,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:23,627 INFO L82 PathProgramCache]: Analyzing trace with hash -907508637, now seen corresponding path program 1 times [2019-09-16 16:18:23,627 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:23,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:23,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:23,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:23,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:23,647 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,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:23,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:23,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:23,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:23,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:23,648 INFO L87 Difference]: Start difference. First operand 22536 states and 25862 transitions. Second operand 3 states. [2019-09-16 16:18:24,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:24,006 INFO L93 Difference]: Finished difference Result 50184 states and 56582 transitions. [2019-09-16 16:18:24,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:24,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-16 16:18:24,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:24,007 INFO L225 Difference]: With dead ends: 50184 [2019-09-16 16:18:24,007 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 16:18:24,070 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,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 16:18:24,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 16:18:24,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 16:18:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 16:18:24,071 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-09-16 16:18:24,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:24,071 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 16:18:24,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:24,071 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 16:18:24,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 16:18:24,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-16 16:18:24,101 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-16 16:18:24,101 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:18:24,101 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:18:24,101 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-16 16:18:24,101 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-16 16:18:24,102 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-16 16:18:24,102 INFO L446 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2019-09-16 16:18:24,102 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2019-09-16 16:18:24,102 INFO L443 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2019-09-16 16:18:24,102 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2019-09-16 16:18:24,102 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2019-09-16 16:18:24,102 INFO L443 ceAbstractionStarter]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2019-09-16 16:18:24,102 INFO L443 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2019-09-16 16:18:24,102 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2019-09-16 16:18:24,103 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-09-16 16:18:24,103 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2019-09-16 16:18:24,103 INFO L443 ceAbstractionStarter]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2019-09-16 16:18:24,103 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2019-09-16 16:18:24,103 INFO L446 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2019-09-16 16:18:24,104 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2019-09-16 16:18:24,104 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-09-16 16:18:24,104 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2019-09-16 16:18:24,104 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-09-16 16:18:24,104 INFO L439 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2019-09-16 16:18:24,105 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2019-09-16 16:18:24,105 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2019-09-16 16:18:24,105 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2019-09-16 16:18:24,105 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-09-16 16:18:24,105 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-09-16 16:18:24,105 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2019-09-16 16:18:24,105 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2019-09-16 16:18:24,105 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2019-09-16 16:18:24,106 INFO L443 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2019-09-16 16:18:24,106 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2019-09-16 16:18:24,106 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-09-16 16:18:24,106 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2019-09-16 16:18:24,106 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2019-09-16 16:18:24,106 INFO L443 ceAbstractionStarter]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2019-09-16 16:18:24,106 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-09-16 16:18:24,106 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-09-16 16:18:24,106 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2019-09-16 16:18:24,106 INFO L443 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2019-09-16 16:18:24,107 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-09-16 16:18:24,107 INFO L443 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2019-09-16 16:18:24,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 04:18:24 BoogieIcfgContainer [2019-09-16 16:18:24,117 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 16:18:24,120 INFO L168 Benchmark]: Toolchain (without parser) took 8785.69 ms. Allocated memory was 132.1 MB in the beginning and 602.4 MB in the end (delta: 470.3 MB). Free memory was 87.9 MB in the beginning and 222.4 MB in the end (delta: -134.5 MB). Peak memory consumption was 335.8 MB. Max. memory is 7.1 GB. [2019-09-16 16:18:24,121 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 132.1 MB. Free memory was 106.3 MB in the beginning and 106.1 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:24,122 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.44 ms. Allocated memory was 132.1 MB in the beginning and 198.2 MB in the end (delta: 66.1 MB). Free memory was 87.7 MB in the beginning and 175.0 MB in the end (delta: -87.3 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-09-16 16:18:24,125 INFO L168 Benchmark]: Boogie Preprocessor took 34.49 ms. Allocated memory is still 198.2 MB. Free memory was 175.0 MB in the beginning and 173.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-09-16 16:18:24,127 INFO L168 Benchmark]: RCFGBuilder took 298.69 ms. Allocated memory is still 198.2 MB. Free memory was 172.7 MB in the beginning and 153.8 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2019-09-16 16:18:24,128 INFO L168 Benchmark]: TraceAbstraction took 8061.77 ms. Allocated memory was 198.2 MB in the beginning and 602.4 MB in the end (delta: 404.2 MB). Free memory was 153.8 MB in the beginning and 222.4 MB in the end (delta: -68.6 MB). Peak memory consumption was 335.6 MB. Max. memory is 7.1 GB. [2019-09-16 16:18:24,131 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.23 ms. Allocated memory is still 132.1 MB. Free memory was 106.3 MB in the beginning and 106.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 386.44 ms. Allocated memory was 132.1 MB in the beginning and 198.2 MB in the end (delta: 66.1 MB). Free memory was 87.7 MB in the beginning and 175.0 MB in the end (delta: -87.3 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.49 ms. Allocated memory is still 198.2 MB. Free memory was 175.0 MB in the beginning and 173.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 298.69 ms. Allocated memory is still 198.2 MB. Free memory was 172.7 MB in the beginning and 153.8 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8061.77 ms. Allocated memory was 198.2 MB in the beginning and 602.4 MB in the end (delta: 404.2 MB). Free memory was 153.8 MB in the beginning and 222.4 MB in the end (delta: -68.6 MB). Peak memory consumption was 335.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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: 39]: 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, 44 locations, 1 error locations. SAFE Result, 7.9s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2384 SDtfs, 1153 SDslu, 1624 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22536occurred in iteration=27, 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: 3.5s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 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.6s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 31265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...