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-efa34d5 [2019-09-16 16:19:08,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:19:08,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:19:08,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:19:08,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:19:08,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:19:08,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:19:08,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:19:08,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:19:08,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:19:08,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:19:08,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:19:08,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:19:08,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:19:08,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:19:08,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:19:08,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:19:08,976 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:19:08,977 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:19:08,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:19:08,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:19:08,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:19:08,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:19:08,983 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:19:08,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:19:08,986 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:19:08,986 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:19:08,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:19:08,987 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:19:08,988 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:19:08,988 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:19:08,989 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:19:08,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:19:08,990 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:19:08,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:19:08,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:19:08,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:19:08,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:19:08,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:19:08,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:19:08,994 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:19:08,995 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-16 16:19:09,008 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:19:09,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:19:09,010 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:19:09,010 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:19:09,010 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:19:09,010 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:19:09,011 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:19:09,011 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:19:09,011 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:19:09,011 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:19:09,011 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:19:09,012 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:19:09,012 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:19:09,012 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:19:09,012 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:19:09,012 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:19:09,013 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:19:09,013 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:19:09,013 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:19:09,013 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:19:09,013 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:19:09,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:19:09,014 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:19:09,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:19:09,014 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:19:09,014 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:19:09,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:19:09,015 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:19:09,015 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:19:09,043 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:19:09,055 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:19:09,058 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:19:09,060 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:19:09,060 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:19:09,061 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-16 16:19:09,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/162c70f48/a9fa991414da4f34b95e1338166dd0cb/FLAG5cc9d3335 [2019-09-16 16:19:09,581 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:19:09,582 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2019-09-16 16:19:09,589 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/162c70f48/a9fa991414da4f34b95e1338166dd0cb/FLAG5cc9d3335 [2019-09-16 16:19:09,962 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/162c70f48/a9fa991414da4f34b95e1338166dd0cb [2019-09-16 16:19:09,974 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:19:09,975 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:19:09,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:19:09,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:19:09,979 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:19:09,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:19:09" (1/1) ... [2019-09-16 16:19:09,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36a43521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:19:09, skipping insertion in model container [2019-09-16 16:19:09,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:19:09" (1/1) ... [2019-09-16 16:19:09,988 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:19:10,006 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:19:10,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:19:10,196 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:19:10,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:19:10,337 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:19:10,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:19:10 WrapperNode [2019-09-16 16:19:10,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:19:10,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:19:10,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:19:10,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:19:10,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:19:10" (1/1) ... [2019-09-16 16:19:10,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:19:10" (1/1) ... [2019-09-16 16:19:10,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:19:10" (1/1) ... [2019-09-16 16:19:10,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:19:10" (1/1) ... [2019-09-16 16:19:10,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:19:10" (1/1) ... [2019-09-16 16:19:10,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:19:10" (1/1) ... [2019-09-16 16:19:10,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:19:10" (1/1) ... [2019-09-16 16:19:10,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:19:10,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:19:10,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:19:10,368 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:19:10,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:19:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:19:10,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:19:10,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:19:10,421 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:19:10,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:19:10,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 16:19:10,421 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:19:10,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:19:10,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:19:10,671 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:19:10,671 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 16:19:10,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:19:10 BoogieIcfgContainer [2019-09-16 16:19:10,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:19:10,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:19:10,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:19:10,677 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:19:10,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:19:09" (1/3) ... [2019-09-16 16:19:10,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0ad217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:19:10, skipping insertion in model container [2019-09-16 16:19:10,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:19:10" (2/3) ... [2019-09-16 16:19:10,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0ad217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:19:10, skipping insertion in model container [2019-09-16 16:19:10,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:19:10" (3/3) ... [2019-09-16 16:19:10,680 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2019-09-16 16:19:10,692 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:19:10,702 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 16:19:10,722 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 16:19:10,781 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:19:10,785 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:19:10,786 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:19:10,786 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:19:10,786 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:19:10,786 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:19:10,786 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:19:10,786 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:19:10,787 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:19:10,810 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-09-16 16:19:10,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 16:19:10,814 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:10,815 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:10,817 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:10,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:10,822 INFO L82 PathProgramCache]: Analyzing trace with hash 429652513, now seen corresponding path program 1 times [2019-09-16 16:19:10,823 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:10,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:10,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:10,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:10,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:10,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:10,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:10,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:10,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:10,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:10,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:11,001 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2019-09-16 16:19:11,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:11,056 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2019-09-16 16:19:11,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:11,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-16 16:19:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:11,070 INFO L225 Difference]: With dead ends: 63 [2019-09-16 16:19:11,070 INFO L226 Difference]: Without dead ends: 48 [2019-09-16 16:19:11,073 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:11,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-16 16:19:11,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-09-16 16:19:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-16 16:19:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2019-09-16 16:19:11,117 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 16 [2019-09-16 16:19:11,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:11,117 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2019-09-16 16:19:11,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:11,118 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2019-09-16 16:19:11,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 16:19:11,119 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:11,119 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:11,119 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:11,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:11,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1109710883, now seen corresponding path program 1 times [2019-09-16 16:19:11,120 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:11,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:11,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:11,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:11,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:11,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:11,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:11,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:11,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:11,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:11,197 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2019-09-16 16:19:11,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:11,220 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2019-09-16 16:19:11,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:11,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-16 16:19:11,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:11,223 INFO L225 Difference]: With dead ends: 77 [2019-09-16 16:19:11,223 INFO L226 Difference]: Without dead ends: 48 [2019-09-16 16:19:11,224 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:11,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-16 16:19:11,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-09-16 16:19:11,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-16 16:19:11,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2019-09-16 16:19:11,232 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 16 [2019-09-16 16:19:11,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:11,233 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2019-09-16 16:19:11,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2019-09-16 16:19:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-16 16:19:11,234 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:11,234 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:11,235 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:11,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:11,235 INFO L82 PathProgramCache]: Analyzing trace with hash 434540691, now seen corresponding path program 1 times [2019-09-16 16:19:11,235 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:11,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:11,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:11,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:11,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:11,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:11,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:11,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:11,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:11,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:11,283 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2019-09-16 16:19:11,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:11,316 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2019-09-16 16:19:11,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:11,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-16 16:19:11,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:11,318 INFO L225 Difference]: With dead ends: 72 [2019-09-16 16:19:11,318 INFO L226 Difference]: Without dead ends: 51 [2019-09-16 16:19:11,319 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:11,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-16 16:19:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-09-16 16:19:11,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-16 16:19:11,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2019-09-16 16:19:11,328 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 17 [2019-09-16 16:19:11,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:11,328 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2019-09-16 16:19:11,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:11,329 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2019-09-16 16:19:11,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-16 16:19:11,330 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:11,330 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:11,330 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:11,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:11,331 INFO L82 PathProgramCache]: Analyzing trace with hash 41513681, now seen corresponding path program 1 times [2019-09-16 16:19:11,331 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:11,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:11,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:11,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:11,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:11,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:11,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:11,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:11,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:11,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:11,379 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 3 states. [2019-09-16 16:19:11,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:11,411 INFO L93 Difference]: Finished difference Result 88 states and 144 transitions. [2019-09-16 16:19:11,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:11,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-16 16:19:11,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:11,413 INFO L225 Difference]: With dead ends: 88 [2019-09-16 16:19:11,414 INFO L226 Difference]: Without dead ends: 86 [2019-09-16 16:19:11,414 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:11,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-16 16:19:11,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2019-09-16 16:19:11,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-16 16:19:11,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2019-09-16 16:19:11,426 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 17 [2019-09-16 16:19:11,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:11,426 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2019-09-16 16:19:11,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:11,426 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2019-09-16 16:19:11,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-16 16:19:11,427 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:11,427 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:11,428 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:11,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:11,428 INFO L82 PathProgramCache]: Analyzing trace with hash 721572051, now seen corresponding path program 1 times [2019-09-16 16:19:11,428 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:11,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:11,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:11,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:11,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:11,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:11,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:11,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:11,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:11,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:11,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:11,467 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 3 states. [2019-09-16 16:19:11,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:11,491 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2019-09-16 16:19:11,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:11,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-16 16:19:11,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:11,492 INFO L225 Difference]: With dead ends: 144 [2019-09-16 16:19:11,492 INFO L226 Difference]: Without dead ends: 88 [2019-09-16 16:19:11,493 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:11,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-16 16:19:11,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-09-16 16:19:11,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-16 16:19:11,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2019-09-16 16:19:11,503 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 17 [2019-09-16 16:19:11,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:11,503 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2019-09-16 16:19:11,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:11,503 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2019-09-16 16:19:11,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-16 16:19:11,504 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:11,504 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:11,505 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:11,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:11,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1287139128, now seen corresponding path program 1 times [2019-09-16 16:19:11,505 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:11,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:11,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:11,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:11,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:11,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:11,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:11,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:11,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:11,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:11,554 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand 3 states. [2019-09-16 16:19:11,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:11,574 INFO L93 Difference]: Finished difference Result 129 states and 205 transitions. [2019-09-16 16:19:11,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:11,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-16 16:19:11,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:11,576 INFO L225 Difference]: With dead ends: 129 [2019-09-16 16:19:11,576 INFO L226 Difference]: Without dead ends: 90 [2019-09-16 16:19:11,577 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:11,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-16 16:19:11,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-09-16 16:19:11,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-16 16:19:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2019-09-16 16:19:11,590 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 18 [2019-09-16 16:19:11,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:11,591 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2019-09-16 16:19:11,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:11,591 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2019-09-16 16:19:11,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-16 16:19:11,592 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:11,595 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:11,595 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:11,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:11,595 INFO L82 PathProgramCache]: Analyzing trace with hash 894112118, now seen corresponding path program 1 times [2019-09-16 16:19:11,595 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:11,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:11,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:11,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:11,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:11,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:11,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:11,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:11,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:11,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:11,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:11,646 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand 3 states. [2019-09-16 16:19:11,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:11,666 INFO L93 Difference]: Finished difference Result 156 states and 248 transitions. [2019-09-16 16:19:11,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:11,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-16 16:19:11,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:11,669 INFO L225 Difference]: With dead ends: 156 [2019-09-16 16:19:11,669 INFO L226 Difference]: Without dead ends: 154 [2019-09-16 16:19:11,670 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:11,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-16 16:19:11,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2019-09-16 16:19:11,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-16 16:19:11,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2019-09-16 16:19:11,686 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 18 [2019-09-16 16:19:11,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:11,687 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2019-09-16 16:19:11,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:11,687 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2019-09-16 16:19:11,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-16 16:19:11,689 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:11,689 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:11,690 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:11,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:11,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170488, now seen corresponding path program 1 times [2019-09-16 16:19:11,691 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:11,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:11,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:11,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:11,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:11,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:11,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:11,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:11,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:11,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:11,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:11,726 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand 3 states. [2019-09-16 16:19:11,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:11,753 INFO L93 Difference]: Finished difference Result 272 states and 424 transitions. [2019-09-16 16:19:11,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:11,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-16 16:19:11,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:11,755 INFO L225 Difference]: With dead ends: 272 [2019-09-16 16:19:11,756 INFO L226 Difference]: Without dead ends: 162 [2019-09-16 16:19:11,757 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:11,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-16 16:19:11,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-09-16 16:19:11,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-16 16:19:11,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2019-09-16 16:19:11,771 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 18 [2019-09-16 16:19:11,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:11,771 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2019-09-16 16:19:11,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:11,771 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2019-09-16 16:19:11,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 16:19:11,773 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:11,773 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:11,773 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:11,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:11,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1947887240, now seen corresponding path program 1 times [2019-09-16 16:19:11,774 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:11,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:11,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:11,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:11,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:11,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:11,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:11,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:11,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:11,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:11,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:11,805 INFO L87 Difference]: Start difference. First operand 160 states and 242 transitions. Second operand 3 states. [2019-09-16 16:19:11,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:11,826 INFO L93 Difference]: Finished difference Result 240 states and 360 transitions. [2019-09-16 16:19:11,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:11,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-16 16:19:11,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:11,828 INFO L225 Difference]: With dead ends: 240 [2019-09-16 16:19:11,828 INFO L226 Difference]: Without dead ends: 166 [2019-09-16 16:19:11,829 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:11,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-16 16:19:11,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-09-16 16:19:11,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-16 16:19:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2019-09-16 16:19:11,841 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 19 [2019-09-16 16:19:11,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:11,841 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2019-09-16 16:19:11,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:11,841 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2019-09-16 16:19:11,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 16:19:11,843 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:11,843 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:11,843 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:11,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:11,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1554860230, now seen corresponding path program 1 times [2019-09-16 16:19:11,844 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:11,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:11,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:11,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:11,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:11,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:11,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:11,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:11,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:11,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:11,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:11,885 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand 3 states. [2019-09-16 16:19:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:11,906 INFO L93 Difference]: Finished difference Result 284 states and 424 transitions. [2019-09-16 16:19:11,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:11,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-16 16:19:11,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:11,908 INFO L225 Difference]: With dead ends: 284 [2019-09-16 16:19:11,908 INFO L226 Difference]: Without dead ends: 282 [2019-09-16 16:19:11,909 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:11,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-16 16:19:11,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2019-09-16 16:19:11,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-16 16:19:11,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2019-09-16 16:19:11,928 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 19 [2019-09-16 16:19:11,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:11,929 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2019-09-16 16:19:11,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:11,929 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2019-09-16 16:19:11,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 16:19:11,930 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:11,931 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:11,931 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:11,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:11,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2060048696, now seen corresponding path program 1 times [2019-09-16 16:19:11,935 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:11,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:11,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:11,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:11,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:11,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:11,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:11,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:11,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:11,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:11,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:11,985 INFO L87 Difference]: Start difference. First operand 232 states and 334 transitions. Second operand 3 states. [2019-09-16 16:19:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:12,028 INFO L93 Difference]: Finished difference Result 524 states and 752 transitions. [2019-09-16 16:19:12,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:12,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-16 16:19:12,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:12,033 INFO L225 Difference]: With dead ends: 524 [2019-09-16 16:19:12,034 INFO L226 Difference]: Without dead ends: 306 [2019-09-16 16:19:12,035 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:12,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-16 16:19:12,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-09-16 16:19:12,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-16 16:19:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2019-09-16 16:19:12,064 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 19 [2019-09-16 16:19:12,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:12,065 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2019-09-16 16:19:12,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:12,065 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2019-09-16 16:19:12,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 16:19:12,067 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:12,067 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:12,068 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:12,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:12,068 INFO L82 PathProgramCache]: Analyzing trace with hash 956242573, now seen corresponding path program 1 times [2019-09-16 16:19:12,068 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:12,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:12,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:12,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:12,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:12,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:12,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:12,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:12,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:12,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:12,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:12,121 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 3 states. [2019-09-16 16:19:12,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:12,145 INFO L93 Difference]: Finished difference Result 456 states and 628 transitions. [2019-09-16 16:19:12,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:12,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-16 16:19:12,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:12,149 INFO L225 Difference]: With dead ends: 456 [2019-09-16 16:19:12,150 INFO L226 Difference]: Without dead ends: 314 [2019-09-16 16:19:12,150 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:12,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-16 16:19:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2019-09-16 16:19:12,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-09-16 16:19:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 422 transitions. [2019-09-16 16:19:12,166 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 422 transitions. Word has length 20 [2019-09-16 16:19:12,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:12,166 INFO L475 AbstractCegarLoop]: Abstraction has 312 states and 422 transitions. [2019-09-16 16:19:12,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:12,166 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 422 transitions. [2019-09-16 16:19:12,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 16:19:12,167 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:12,167 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:12,167 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:12,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:12,168 INFO L82 PathProgramCache]: Analyzing trace with hash 563215563, now seen corresponding path program 1 times [2019-09-16 16:19:12,168 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:12,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:12,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:12,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:12,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:12,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:12,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:12,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:12,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:12,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:12,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:12,227 INFO L87 Difference]: Start difference. First operand 312 states and 422 transitions. Second operand 3 states. [2019-09-16 16:19:12,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:12,251 INFO L93 Difference]: Finished difference Result 524 states and 712 transitions. [2019-09-16 16:19:12,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:12,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-16 16:19:12,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:12,255 INFO L225 Difference]: With dead ends: 524 [2019-09-16 16:19:12,256 INFO L226 Difference]: Without dead ends: 522 [2019-09-16 16:19:12,256 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:12,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-09-16 16:19:12,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2019-09-16 16:19:12,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-16 16:19:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2019-09-16 16:19:12,272 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 20 [2019-09-16 16:19:12,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:12,272 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2019-09-16 16:19:12,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2019-09-16 16:19:12,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 16:19:12,276 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:12,276 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:12,277 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:12,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:12,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1243273933, now seen corresponding path program 1 times [2019-09-16 16:19:12,277 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:12,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:12,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:12,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:12,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:12,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-16 16:19:12,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:12,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:12,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:12,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:12,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:12,312 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 3 states. [2019-09-16 16:19:12,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:12,337 INFO L93 Difference]: Finished difference Result 1020 states and 1320 transitions. [2019-09-16 16:19:12,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:12,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-16 16:19:12,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:12,341 INFO L225 Difference]: With dead ends: 1020 [2019-09-16 16:19:12,341 INFO L226 Difference]: Without dead ends: 586 [2019-09-16 16:19:12,342 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:12,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-09-16 16:19:12,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-09-16 16:19:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-16 16:19:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 726 transitions. [2019-09-16 16:19:12,362 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 726 transitions. Word has length 20 [2019-09-16 16:19:12,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:12,363 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 726 transitions. [2019-09-16 16:19:12,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:12,363 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 726 transitions. [2019-09-16 16:19:12,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 16:19:12,364 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:12,364 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:12,364 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:12,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:12,365 INFO L82 PathProgramCache]: Analyzing trace with hash 280029309, now seen corresponding path program 1 times [2019-09-16 16:19:12,365 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:12,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:12,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:12,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:12,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:12,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:12,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:12,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:12,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:12,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:12,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:12,381 INFO L87 Difference]: Start difference. First operand 584 states and 726 transitions. Second operand 3 states. [2019-09-16 16:19:12,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:12,403 INFO L93 Difference]: Finished difference Result 876 states and 1080 transitions. [2019-09-16 16:19:12,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:12,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-16 16:19:12,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:12,407 INFO L225 Difference]: With dead ends: 876 [2019-09-16 16:19:12,407 INFO L226 Difference]: Without dead ends: 602 [2019-09-16 16:19:12,408 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:12,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-16 16:19:12,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-09-16 16:19:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-09-16 16:19:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 726 transitions. [2019-09-16 16:19:12,428 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 726 transitions. Word has length 21 [2019-09-16 16:19:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:12,428 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 726 transitions. [2019-09-16 16:19:12,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:12,429 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 726 transitions. [2019-09-16 16:19:12,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 16:19:12,430 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:12,430 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:12,430 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:12,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:12,430 INFO L82 PathProgramCache]: Analyzing trace with hash -112997701, now seen corresponding path program 1 times [2019-09-16 16:19:12,431 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:12,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:12,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:12,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:12,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:12,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:12,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:12,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:12,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:12,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:12,446 INFO L87 Difference]: Start difference. First operand 600 states and 726 transitions. Second operand 3 states. [2019-09-16 16:19:12,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:12,477 INFO L93 Difference]: Finished difference Result 970 states and 1159 transitions. [2019-09-16 16:19:12,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:12,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-16 16:19:12,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:12,481 INFO L225 Difference]: With dead ends: 970 [2019-09-16 16:19:12,482 INFO L226 Difference]: Without dead ends: 968 [2019-09-16 16:19:12,482 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:12,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-09-16 16:19:12,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 904. [2019-09-16 16:19:12,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-09-16 16:19:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1062 transitions. [2019-09-16 16:19:12,508 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1062 transitions. Word has length 21 [2019-09-16 16:19:12,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:12,508 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1062 transitions. [2019-09-16 16:19:12,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1062 transitions. [2019-09-16 16:19:12,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 16:19:12,510 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:12,511 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:12,511 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:12,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:12,511 INFO L82 PathProgramCache]: Analyzing trace with hash 567060669, now seen corresponding path program 1 times [2019-09-16 16:19:12,511 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:12,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:12,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:12,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:12,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:12,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:12,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:12,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:12,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:12,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:12,526 INFO L87 Difference]: Start difference. First operand 904 states and 1062 transitions. Second operand 3 states. [2019-09-16 16:19:12,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:12,563 INFO L93 Difference]: Finished difference Result 1992 states and 2278 transitions. [2019-09-16 16:19:12,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:12,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-16 16:19:12,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:12,564 INFO L225 Difference]: With dead ends: 1992 [2019-09-16 16:19:12,565 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 16:19:12,568 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:12,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 16:19:12,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 16:19:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 16:19:12,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 16:19:12,569 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-09-16 16:19:12,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:12,570 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 16:19:12,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:12,570 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 16:19:12,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 16:19:12,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-16 16:19:12,594 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-16 16:19:12,595 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:19:12,595 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:19:12,595 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-16 16:19:12,595 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-16 16:19:12,595 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-16 16:19:12,595 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-09-16 16:19:12,595 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 107) no Hoare annotation was computed. [2019-09-16 16:19:12,596 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2019-09-16 16:19:12,596 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-09-16 16:19:12,596 INFO L446 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2019-09-16 16:19:12,596 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2019-09-16 16:19:12,596 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2019-09-16 16:19:12,596 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2019-09-16 16:19:12,596 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2019-09-16 16:19:12,597 INFO L443 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-09-16 16:19:12,597 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 107) no Hoare annotation was computed. [2019-09-16 16:19:12,597 INFO L443 ceAbstractionStarter]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2019-09-16 16:19:12,597 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2019-09-16 16:19:12,597 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-09-16 16:19:12,597 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2019-09-16 16:19:12,597 INFO L446 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2019-09-16 16:19:12,598 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-09-16 16:19:12,598 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-09-16 16:19:12,598 INFO L443 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-09-16 16:19:12,598 INFO L439 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2019-09-16 16:19:12,598 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2019-09-16 16:19:12,598 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2019-09-16 16:19:12,599 INFO L443 ceAbstractionStarter]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2019-09-16 16:19:12,599 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-09-16 16:19:12,599 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2019-09-16 16:19:12,599 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2019-09-16 16:19:12,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 04:19:12 BoogieIcfgContainer [2019-09-16 16:19:12,607 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 16:19:12,609 INFO L168 Benchmark]: Toolchain (without parser) took 2633.45 ms. Allocated memory was 141.0 MB in the beginning and 227.0 MB in the end (delta: 86.0 MB). Free memory was 87.0 MB in the beginning and 91.6 MB in the end (delta: -4.6 MB). Peak memory consumption was 81.4 MB. Max. memory is 7.1 GB. [2019-09-16 16:19:12,610 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 105.7 MB in the beginning and 105.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 16:19:12,611 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.61 ms. Allocated memory was 141.0 MB in the beginning and 200.3 MB in the end (delta: 59.2 MB). Free memory was 86.8 MB in the beginning and 178.8 MB in the end (delta: -92.0 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-09-16 16:19:12,612 INFO L168 Benchmark]: Boogie Preprocessor took 28.55 ms. Allocated memory is still 200.3 MB. Free memory was 178.2 MB in the beginning and 176.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-09-16 16:19:12,613 INFO L168 Benchmark]: RCFGBuilder took 305.32 ms. Allocated memory is still 200.3 MB. Free memory was 176.6 MB in the beginning and 161.6 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2019-09-16 16:19:12,614 INFO L168 Benchmark]: TraceAbstraction took 1933.06 ms. Allocated memory was 200.3 MB in the beginning and 227.0 MB in the end (delta: 26.7 MB). Free memory was 161.0 MB in the beginning and 91.6 MB in the end (delta: 69.4 MB). Peak memory consumption was 96.2 MB. Max. memory is 7.1 GB. [2019-09-16 16:19:12,617 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.21 ms. Allocated memory is still 141.0 MB. Free memory was 105.7 MB in the beginning and 105.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 362.61 ms. Allocated memory was 141.0 MB in the beginning and 200.3 MB in the end (delta: 59.2 MB). Free memory was 86.8 MB in the beginning and 178.8 MB in the end (delta: -92.0 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.55 ms. Allocated memory is still 200.3 MB. Free memory was 178.2 MB in the beginning and 176.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 305.32 ms. Allocated memory is still 200.3 MB. Free memory was 176.6 MB in the beginning and 161.6 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1933.06 ms. Allocated memory was 200.3 MB in the beginning and 227.0 MB in the end (delta: 26.7 MB). Free memory was 161.0 MB in the beginning and 91.6 MB in the end (delta: 69.4 MB). Peak memory consumption was 96.2 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, 1.8s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 0.5s 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.1s 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.2s 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.1s 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...