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_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 13:05:07,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 13:05:07,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 13:05:07,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 13:05:07,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 13:05:07,960 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 13:05:07,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 13:05:07,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 13:05:07,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 13:05:07,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 13:05:07,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 13:05:07,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 13:05:07,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 13:05:07,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 13:05:07,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 13:05:07,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 13:05:07,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 13:05:07,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 13:05:07,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 13:05:07,978 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 13:05:07,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 13:05:07,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 13:05:07,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 13:05:07,983 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 13:05:07,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 13:05:07,988 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 13:05:07,988 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 13:05:07,989 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 13:05:07,990 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 13:05:07,991 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 13:05:07,991 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 13:05:07,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 13:05:07,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 13:05:07,996 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 13:05:07,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 13:05:08,002 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 13:05:08,003 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 13:05:08,003 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 13:05:08,003 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 13:05:08,005 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 13:05:08,006 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 13:05:08,008 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 13:05:08,035 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 13:05:08,035 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 13:05:08,038 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 13:05:08,038 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 13:05:08,038 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 13:05:08,038 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 13:05:08,039 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 13:05:08,039 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 13:05:08,039 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 13:05:08,039 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 13:05:08,040 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 13:05:08,041 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 13:05:08,041 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 13:05:08,041 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 13:05:08,042 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 13:05:08,042 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 13:05:08,042 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 13:05:08,042 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 13:05:08,043 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 13:05:08,043 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 13:05:08,043 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 13:05:08,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:05:08,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 13:05:08,044 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 13:05:08,044 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 13:05:08,044 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 13:05:08,045 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 13:05:08,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 13:05:08,045 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 13:05:08,094 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 13:05:08,106 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 13:05:08,109 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 13:05:08,111 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 13:05:08,111 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 13:05:08,112 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2019-09-07 13:05:08,177 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e3d03ab8/accb326556b04272b9bf2508b015d206/FLAG96c53ceb3 [2019-09-07 13:05:08,630 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 13:05:08,631 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2019-09-07 13:05:08,639 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e3d03ab8/accb326556b04272b9bf2508b015d206/FLAG96c53ceb3 [2019-09-07 13:05:09,043 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e3d03ab8/accb326556b04272b9bf2508b015d206 [2019-09-07 13:05:09,058 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 13:05:09,059 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 13:05:09,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 13:05:09,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 13:05:09,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 13:05:09,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:05:09" (1/1) ... [2019-09-07 13:05:09,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5160516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:09, skipping insertion in model container [2019-09-07 13:05:09,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:05:09" (1/1) ... [2019-09-07 13:05:09,077 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 13:05:09,097 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 13:05:09,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:05:09,320 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 13:05:09,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:05:09,443 INFO L192 MainTranslator]: Completed translation [2019-09-07 13:05:09,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:09 WrapperNode [2019-09-07 13:05:09,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 13:05:09,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 13:05:09,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 13:05:09,446 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 13:05:09,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:09" (1/1) ... [2019-09-07 13:05:09,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:09" (1/1) ... [2019-09-07 13:05:09,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:09" (1/1) ... [2019-09-07 13:05:09,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:09" (1/1) ... [2019-09-07 13:05:09,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:09" (1/1) ... [2019-09-07 13:05:09,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:09" (1/1) ... [2019-09-07 13:05:09,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:09" (1/1) ... [2019-09-07 13:05:09,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 13:05:09,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 13:05:09,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 13:05:09,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 13:05:09,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:05:09,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 13:05:09,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 13:05:09,538 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 13:05:09,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 13:05:09,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 13:05:09,538 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 13:05:09,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 13:05:09,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 13:05:09,798 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 13:05:09,798 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 13:05:09,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:05:09 BoogieIcfgContainer [2019-09-07 13:05:09,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 13:05:09,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 13:05:09,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 13:05:09,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 13:05:09,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 01:05:09" (1/3) ... [2019-09-07 13:05:09,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@203af49e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:05:09, skipping insertion in model container [2019-09-07 13:05:09,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:09" (2/3) ... [2019-09-07 13:05:09,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@203af49e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:05:09, skipping insertion in model container [2019-09-07 13:05:09,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:05:09" (3/3) ... [2019-09-07 13:05:09,808 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2019-09-07 13:05:09,822 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 13:05:09,834 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 13:05:09,856 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 13:05:09,924 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 13:05:09,925 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 13:05:09,925 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 13:05:09,925 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 13:05:09,925 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 13:05:09,926 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 13:05:09,926 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 13:05:09,926 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 13:05:09,926 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 13:05:09,950 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-09-07 13:05:09,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-07 13:05:09,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:09,956 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:09,959 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:09,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:09,965 INFO L82 PathProgramCache]: Analyzing trace with hash 429652513, now seen corresponding path program 1 times [2019-09-07 13:05:09,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:09,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:10,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:10,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:10,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:10,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:10,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:10,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:10,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:10,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:10,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:10,151 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2019-09-07 13:05:10,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:10,219 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2019-09-07 13:05:10,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:10,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-07 13:05:10,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:10,235 INFO L225 Difference]: With dead ends: 63 [2019-09-07 13:05:10,235 INFO L226 Difference]: Without dead ends: 48 [2019-09-07 13:05:10,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:10,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-07 13:05:10,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-09-07 13:05:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-07 13:05:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2019-09-07 13:05:10,325 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 16 [2019-09-07 13:05:10,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:10,326 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2019-09-07 13:05:10,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:10,326 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2019-09-07 13:05:10,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-07 13:05:10,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:10,329 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:10,330 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:10,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:10,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1109710883, now seen corresponding path program 1 times [2019-09-07 13:05:10,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:10,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:10,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:10,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:10,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:10,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:10,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:10,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:10,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:10,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:10,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:10,459 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2019-09-07 13:05:10,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:10,492 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2019-09-07 13:05:10,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:10,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-07 13:05:10,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:10,496 INFO L225 Difference]: With dead ends: 77 [2019-09-07 13:05:10,496 INFO L226 Difference]: Without dead ends: 48 [2019-09-07 13:05:10,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:10,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-07 13:05:10,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-09-07 13:05:10,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-07 13:05:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2019-09-07 13:05:10,513 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 16 [2019-09-07 13:05:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:10,514 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2019-09-07 13:05:10,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:10,515 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2019-09-07 13:05:10,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-07 13:05:10,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:10,516 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:10,517 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:10,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:10,518 INFO L82 PathProgramCache]: Analyzing trace with hash 434540691, now seen corresponding path program 1 times [2019-09-07 13:05:10,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:10,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:10,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:10,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:10,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:10,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:10,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:10,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:10,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:10,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:10,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:10,579 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2019-09-07 13:05:10,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:10,617 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2019-09-07 13:05:10,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:10,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-07 13:05:10,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:10,621 INFO L225 Difference]: With dead ends: 72 [2019-09-07 13:05:10,621 INFO L226 Difference]: Without dead ends: 51 [2019-09-07 13:05:10,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:10,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-07 13:05:10,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-09-07 13:05:10,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-07 13:05:10,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2019-09-07 13:05:10,639 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 17 [2019-09-07 13:05:10,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:10,643 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2019-09-07 13:05:10,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2019-09-07 13:05:10,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-07 13:05:10,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:10,647 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:10,648 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:10,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:10,649 INFO L82 PathProgramCache]: Analyzing trace with hash 41513681, now seen corresponding path program 1 times [2019-09-07 13:05:10,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:10,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:10,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:10,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:10,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:10,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:10,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:10,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:10,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:10,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:10,716 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 3 states. [2019-09-07 13:05:10,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:10,740 INFO L93 Difference]: Finished difference Result 88 states and 144 transitions. [2019-09-07 13:05:10,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:10,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-07 13:05:10,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:10,743 INFO L225 Difference]: With dead ends: 88 [2019-09-07 13:05:10,743 INFO L226 Difference]: Without dead ends: 86 [2019-09-07 13:05:10,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:10,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-07 13:05:10,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2019-09-07 13:05:10,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-07 13:05:10,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2019-09-07 13:05:10,766 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 17 [2019-09-07 13:05:10,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:10,766 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2019-09-07 13:05:10,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:10,767 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2019-09-07 13:05:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-07 13:05:10,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:10,768 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:10,769 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:10,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:10,770 INFO L82 PathProgramCache]: Analyzing trace with hash 721572051, now seen corresponding path program 1 times [2019-09-07 13:05:10,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:10,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:10,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:10,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:10,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:10,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:10,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:10,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:10,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:10,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:10,836 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 3 states. [2019-09-07 13:05:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:10,871 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2019-09-07 13:05:10,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:10,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-07 13:05:10,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:10,873 INFO L225 Difference]: With dead ends: 144 [2019-09-07 13:05:10,876 INFO L226 Difference]: Without dead ends: 88 [2019-09-07 13:05:10,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:10,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-07 13:05:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-09-07 13:05:10,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-07 13:05:10,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2019-09-07 13:05:10,896 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 17 [2019-09-07 13:05:10,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:10,897 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2019-09-07 13:05:10,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:10,897 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2019-09-07 13:05:10,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-07 13:05:10,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:10,902 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:10,903 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:10,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:10,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1287139128, now seen corresponding path program 1 times [2019-09-07 13:05:10,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:10,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:10,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:10,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:10,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:10,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:10,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:10,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:10,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:10,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:10,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:10,940 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand 3 states. [2019-09-07 13:05:10,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:10,957 INFO L93 Difference]: Finished difference Result 129 states and 205 transitions. [2019-09-07 13:05:10,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:10,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-07 13:05:10,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:10,959 INFO L225 Difference]: With dead ends: 129 [2019-09-07 13:05:10,959 INFO L226 Difference]: Without dead ends: 90 [2019-09-07 13:05:10,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:10,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-07 13:05:10,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-09-07 13:05:10,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-07 13:05:10,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2019-09-07 13:05:10,969 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 18 [2019-09-07 13:05:10,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:10,970 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2019-09-07 13:05:10,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:10,970 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2019-09-07 13:05:10,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-07 13:05:10,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:10,972 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:10,972 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:10,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:10,973 INFO L82 PathProgramCache]: Analyzing trace with hash 894112118, now seen corresponding path program 1 times [2019-09-07 13:05:10,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:10,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:10,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:10,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:10,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:11,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:11,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:11,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:11,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:11,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:11,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:11,007 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand 3 states. [2019-09-07 13:05:11,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:11,031 INFO L93 Difference]: Finished difference Result 156 states and 248 transitions. [2019-09-07 13:05:11,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:11,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-07 13:05:11,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:11,033 INFO L225 Difference]: With dead ends: 156 [2019-09-07 13:05:11,033 INFO L226 Difference]: Without dead ends: 154 [2019-09-07 13:05:11,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:11,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-07 13:05:11,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2019-09-07 13:05:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-07 13:05:11,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2019-09-07 13:05:11,052 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 18 [2019-09-07 13:05:11,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:11,053 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2019-09-07 13:05:11,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:11,057 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2019-09-07 13:05:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-07 13:05:11,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:11,059 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:11,059 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:11,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:11,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170488, now seen corresponding path program 1 times [2019-09-07 13:05:11,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:11,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:11,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:11,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:11,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:11,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:11,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:11,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:11,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:11,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:11,096 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand 3 states. [2019-09-07 13:05:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:11,136 INFO L93 Difference]: Finished difference Result 272 states and 424 transitions. [2019-09-07 13:05:11,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:11,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-07 13:05:11,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:11,139 INFO L225 Difference]: With dead ends: 272 [2019-09-07 13:05:11,139 INFO L226 Difference]: Without dead ends: 162 [2019-09-07 13:05:11,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:11,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-07 13:05:11,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-09-07 13:05:11,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-07 13:05:11,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2019-09-07 13:05:11,173 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 18 [2019-09-07 13:05:11,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:11,173 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2019-09-07 13:05:11,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:11,174 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2019-09-07 13:05:11,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 13:05:11,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:11,176 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:11,177 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:11,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:11,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1947887240, now seen corresponding path program 1 times [2019-09-07 13:05:11,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:11,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:11,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:11,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:11,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:11,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:11,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:11,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:11,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:11,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:11,219 INFO L87 Difference]: Start difference. First operand 160 states and 242 transitions. Second operand 3 states. [2019-09-07 13:05:11,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:11,261 INFO L93 Difference]: Finished difference Result 240 states and 360 transitions. [2019-09-07 13:05:11,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:11,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-07 13:05:11,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:11,264 INFO L225 Difference]: With dead ends: 240 [2019-09-07 13:05:11,265 INFO L226 Difference]: Without dead ends: 166 [2019-09-07 13:05:11,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:11,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-07 13:05:11,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-09-07 13:05:11,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-07 13:05:11,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2019-09-07 13:05:11,282 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 19 [2019-09-07 13:05:11,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:11,282 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2019-09-07 13:05:11,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:11,283 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2019-09-07 13:05:11,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 13:05:11,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:11,284 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:11,285 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:11,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:11,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1554860230, now seen corresponding path program 1 times [2019-09-07 13:05:11,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:11,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:11,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:11,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:11,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:11,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:11,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:11,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:11,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:11,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:11,312 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand 3 states. [2019-09-07 13:05:11,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:11,344 INFO L93 Difference]: Finished difference Result 284 states and 424 transitions. [2019-09-07 13:05:11,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:11,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-07 13:05:11,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:11,347 INFO L225 Difference]: With dead ends: 284 [2019-09-07 13:05:11,347 INFO L226 Difference]: Without dead ends: 282 [2019-09-07 13:05:11,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:11,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-07 13:05:11,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2019-09-07 13:05:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-07 13:05:11,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2019-09-07 13:05:11,362 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 19 [2019-09-07 13:05:11,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:11,363 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2019-09-07 13:05:11,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:11,363 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2019-09-07 13:05:11,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 13:05:11,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:11,364 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:11,365 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:11,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:11,365 INFO L82 PathProgramCache]: Analyzing trace with hash -2060048696, now seen corresponding path program 1 times [2019-09-07 13:05:11,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:11,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:11,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:11,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:11,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:11,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-07 13:05:11,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:11,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:11,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:11,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:11,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:11,400 INFO L87 Difference]: Start difference. First operand 232 states and 334 transitions. Second operand 3 states. [2019-09-07 13:05:11,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:11,421 INFO L93 Difference]: Finished difference Result 524 states and 752 transitions. [2019-09-07 13:05:11,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:11,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-07 13:05:11,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:11,423 INFO L225 Difference]: With dead ends: 524 [2019-09-07 13:05:11,423 INFO L226 Difference]: Without dead ends: 306 [2019-09-07 13:05:11,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:11,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-07 13:05:11,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-09-07 13:05:11,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-07 13:05:11,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2019-09-07 13:05:11,436 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 19 [2019-09-07 13:05:11,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:11,437 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2019-09-07 13:05:11,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:11,437 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2019-09-07 13:05:11,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 13:05:11,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:11,438 INFO L399 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-07 13:05:11,439 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:11,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:11,439 INFO L82 PathProgramCache]: Analyzing trace with hash 956242573, now seen corresponding path program 1 times [2019-09-07 13:05:11,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:11,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:11,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:11,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:11,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:11,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:11,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:11,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:11,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:11,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:11,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:11,466 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 3 states. [2019-09-07 13:05:11,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:11,484 INFO L93 Difference]: Finished difference Result 456 states and 628 transitions. [2019-09-07 13:05:11,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:11,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-07 13:05:11,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:11,486 INFO L225 Difference]: With dead ends: 456 [2019-09-07 13:05:11,487 INFO L226 Difference]: Without dead ends: 314 [2019-09-07 13:05:11,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:11,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-07 13:05:11,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2019-09-07 13:05:11,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-09-07 13:05:11,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 422 transitions. [2019-09-07 13:05:11,499 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 422 transitions. Word has length 20 [2019-09-07 13:05:11,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:11,499 INFO L475 AbstractCegarLoop]: Abstraction has 312 states and 422 transitions. [2019-09-07 13:05:11,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:11,499 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 422 transitions. [2019-09-07 13:05:11,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 13:05:11,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:11,500 INFO L399 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-07 13:05:11,501 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:11,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:11,501 INFO L82 PathProgramCache]: Analyzing trace with hash 563215563, now seen corresponding path program 1 times [2019-09-07 13:05:11,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:11,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:11,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:11,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:11,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:11,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:11,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:11,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:11,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:11,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:11,536 INFO L87 Difference]: Start difference. First operand 312 states and 422 transitions. Second operand 3 states. [2019-09-07 13:05:11,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:11,558 INFO L93 Difference]: Finished difference Result 524 states and 712 transitions. [2019-09-07 13:05:11,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:11,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-07 13:05:11,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:11,563 INFO L225 Difference]: With dead ends: 524 [2019-09-07 13:05:11,563 INFO L226 Difference]: Without dead ends: 522 [2019-09-07 13:05:11,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:11,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-09-07 13:05:11,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2019-09-07 13:05:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-07 13:05:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2019-09-07 13:05:11,579 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 20 [2019-09-07 13:05:11,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:11,579 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2019-09-07 13:05:11,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:11,579 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2019-09-07 13:05:11,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 13:05:11,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:11,583 INFO L399 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-07 13:05:11,583 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:11,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:11,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1243273933, now seen corresponding path program 1 times [2019-09-07 13:05:11,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:11,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:11,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:11,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:11,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:11,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-07 13:05:11,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:11,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:11,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:11,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:11,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:11,610 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 3 states. [2019-09-07 13:05:11,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:11,637 INFO L93 Difference]: Finished difference Result 1020 states and 1320 transitions. [2019-09-07 13:05:11,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:11,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-07 13:05:11,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:11,644 INFO L225 Difference]: With dead ends: 1020 [2019-09-07 13:05:11,644 INFO L226 Difference]: Without dead ends: 586 [2019-09-07 13:05:11,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:11,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-09-07 13:05:11,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-09-07 13:05:11,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-07 13:05:11,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 726 transitions. [2019-09-07 13:05:11,670 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 726 transitions. Word has length 20 [2019-09-07 13:05:11,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:11,670 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 726 transitions. [2019-09-07 13:05:11,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:11,670 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 726 transitions. [2019-09-07 13:05:11,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-07 13:05:11,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:11,673 INFO L399 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-07 13:05:11,673 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:11,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:11,674 INFO L82 PathProgramCache]: Analyzing trace with hash 280029309, now seen corresponding path program 1 times [2019-09-07 13:05:11,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:11,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:11,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:11,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:11,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:11,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:11,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:11,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:11,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:11,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:11,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:11,714 INFO L87 Difference]: Start difference. First operand 584 states and 726 transitions. Second operand 3 states. [2019-09-07 13:05:11,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:11,741 INFO L93 Difference]: Finished difference Result 876 states and 1080 transitions. [2019-09-07 13:05:11,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:11,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-07 13:05:11,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:11,746 INFO L225 Difference]: With dead ends: 876 [2019-09-07 13:05:11,747 INFO L226 Difference]: Without dead ends: 602 [2019-09-07 13:05:11,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:11,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-07 13:05:11,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-09-07 13:05:11,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-09-07 13:05:11,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 726 transitions. [2019-09-07 13:05:11,774 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 726 transitions. Word has length 21 [2019-09-07 13:05:11,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:11,775 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 726 transitions. [2019-09-07 13:05:11,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:11,775 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 726 transitions. [2019-09-07 13:05:11,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-07 13:05:11,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:11,777 INFO L399 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-07 13:05:11,777 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:11,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:11,778 INFO L82 PathProgramCache]: Analyzing trace with hash -112997701, now seen corresponding path program 1 times [2019-09-07 13:05:11,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:11,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:11,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:11,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:11,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:11,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:11,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:11,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:11,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:11,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:11,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:11,806 INFO L87 Difference]: Start difference. First operand 600 states and 726 transitions. Second operand 3 states. [2019-09-07 13:05:11,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:11,834 INFO L93 Difference]: Finished difference Result 970 states and 1159 transitions. [2019-09-07 13:05:11,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:11,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-07 13:05:11,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:11,840 INFO L225 Difference]: With dead ends: 970 [2019-09-07 13:05:11,840 INFO L226 Difference]: Without dead ends: 968 [2019-09-07 13:05:11,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:11,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-09-07 13:05:11,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 904. [2019-09-07 13:05:11,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-09-07 13:05:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1062 transitions. [2019-09-07 13:05:11,868 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1062 transitions. Word has length 21 [2019-09-07 13:05:11,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:11,869 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1062 transitions. [2019-09-07 13:05:11,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:11,869 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1062 transitions. [2019-09-07 13:05:11,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-07 13:05:11,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:11,871 INFO L399 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-07 13:05:11,871 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:11,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:11,872 INFO L82 PathProgramCache]: Analyzing trace with hash 567060669, now seen corresponding path program 1 times [2019-09-07 13:05:11,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:11,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:11,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:11,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:11,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:11,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:11,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:11,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:11,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:11,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:11,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:11,892 INFO L87 Difference]: Start difference. First operand 904 states and 1062 transitions. Second operand 3 states. [2019-09-07 13:05:11,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:11,928 INFO L93 Difference]: Finished difference Result 1992 states and 2278 transitions. [2019-09-07 13:05:11,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:11,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-07 13:05:11,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:11,930 INFO L225 Difference]: With dead ends: 1992 [2019-09-07 13:05:11,930 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 13:05:11,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:11,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 13:05:11,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 13:05:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 13:05:11,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 13:05:11,935 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-09-07 13:05:11,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:11,935 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 13:05:11,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:11,936 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 13:05:11,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 13:05:11,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 13:05:11,960 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-07 13:05:11,960 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:05:11,960 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:05:11,960 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-07 13:05:11,960 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 13:05:11,961 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 13:05:11,961 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-09-07 13:05:11,961 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-09-07 13:05:11,961 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 107) no Hoare annotation was computed. [2019-09-07 13:05:11,961 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2019-09-07 13:05:11,961 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-09-07 13:05:11,962 INFO L446 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2019-09-07 13:05:11,962 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2019-09-07 13:05:11,962 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2019-09-07 13:05:11,962 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2019-09-07 13:05:11,963 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2019-09-07 13:05:11,963 INFO L443 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-09-07 13:05:11,963 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 107) no Hoare annotation was computed. [2019-09-07 13:05:11,963 INFO L443 ceAbstractionStarter]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2019-09-07 13:05:11,963 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2019-09-07 13:05:11,963 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-09-07 13:05:11,963 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2019-09-07 13:05:11,964 INFO L446 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2019-09-07 13:05:11,964 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-09-07 13:05:11,964 INFO L443 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-09-07 13:05:11,965 INFO L439 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2019-09-07 13:05:11,965 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2019-09-07 13:05:11,965 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2019-09-07 13:05:11,965 INFO L443 ceAbstractionStarter]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2019-09-07 13:05:11,966 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-09-07 13:05:11,966 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2019-09-07 13:05:11,967 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2019-09-07 13:05:11,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 01:05:11 BoogieIcfgContainer [2019-09-07 13:05:11,978 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 13:05:11,982 INFO L168 Benchmark]: Toolchain (without parser) took 2920.90 ms. Allocated memory was 132.6 MB in the beginning and 223.9 MB in the end (delta: 91.2 MB). Free memory was 88.9 MB in the beginning and 90.5 MB in the end (delta: -1.6 MB). Peak memory consumption was 89.6 MB. Max. memory is 7.1 GB. [2019-09-07 13:05:11,984 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory was 107.1 MB in the beginning and 106.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 13:05:11,988 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.40 ms. Allocated memory was 132.6 MB in the beginning and 199.8 MB in the end (delta: 67.1 MB). Free memory was 88.5 MB in the beginning and 176.9 MB in the end (delta: -88.4 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2019-09-07 13:05:11,989 INFO L168 Benchmark]: Boogie Preprocessor took 34.90 ms. Allocated memory is still 199.8 MB. Free memory was 176.9 MB in the beginning and 174.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-09-07 13:05:11,990 INFO L168 Benchmark]: RCFGBuilder took 319.57 ms. Allocated memory is still 199.8 MB. Free memory was 174.7 MB in the beginning and 159.8 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2019-09-07 13:05:11,991 INFO L168 Benchmark]: TraceAbstraction took 2177.37 ms. Allocated memory was 199.8 MB in the beginning and 223.9 MB in the end (delta: 24.1 MB). Free memory was 159.8 MB in the beginning and 90.5 MB in the end (delta: 69.2 MB). Peak memory consumption was 93.3 MB. Max. memory is 7.1 GB. [2019-09-07 13:05:11,995 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.22 ms. Allocated memory is still 132.6 MB. Free memory was 107.1 MB in the beginning and 106.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 384.40 ms. Allocated memory was 132.6 MB in the beginning and 199.8 MB in the end (delta: 67.1 MB). Free memory was 88.5 MB in the beginning and 176.9 MB in the end (delta: -88.4 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.90 ms. Allocated memory is still 199.8 MB. Free memory was 176.9 MB in the beginning and 174.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 319.57 ms. Allocated memory is still 199.8 MB. Free memory was 174.7 MB in the beginning and 159.8 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2177.37 ms. Allocated memory was 199.8 MB in the beginning and 223.9 MB in the end (delta: 24.1 MB). Free memory was 159.8 MB in the beginning and 90.5 MB in the end (delta: 69.2 MB). Peak memory consumption was 93.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. SAFE Result, 2.0s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 923 SDtfs, 417 SDslu, 612 SDs, 0 SdLazy, 91 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=16, 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: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 74 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.4s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 9690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...