java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:00:15,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:00:15,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:00:15,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:00:15,928 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:00:15,929 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:00:15,930 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:00:15,932 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:00:15,934 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:00:15,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:00:15,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:00:15,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:00:15,938 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:00:15,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:00:15,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:00:15,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:00:15,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:00:15,943 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:00:15,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:00:15,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:00:15,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:00:15,950 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:00:15,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:00:15,952 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:00:15,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:00:15,956 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:00:15,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:00:15,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:00:15,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:00:15,959 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:00:15,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:00:15,960 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:00:15,961 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:00:15,962 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:00:15,963 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:00:15,963 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:00:15,964 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:00:15,964 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:00:15,965 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:00:15,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:00:15,966 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:00:15,967 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-20 13:00:15,998 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:00:15,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:00:16,002 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:00:16,003 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:00:16,003 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:00:16,003 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:00:16,003 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:00:16,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:00:16,004 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:00:16,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:00:16,006 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:00:16,006 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:00:16,006 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:00:16,007 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:00:16,007 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:00:16,007 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:00:16,007 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:00:16,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:00:16,008 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:00:16,008 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:00:16,008 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:00:16,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:00:16,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:00:16,009 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:00:16,009 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:00:16,009 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:00:16,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:00:16,010 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:00:16,010 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:00:16,039 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:00:16,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:00:16,056 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:00:16,058 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:00:16,059 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:00:16,059 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2019-09-20 13:00:16,140 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f26eb9f83/ce29cfbea51342528a4d7b262d749cbc/FLAGd5fad9c43 [2019-09-20 13:00:16,563 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:00:16,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2019-09-20 13:00:16,578 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f26eb9f83/ce29cfbea51342528a4d7b262d749cbc/FLAGd5fad9c43 [2019-09-20 13:00:16,917 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f26eb9f83/ce29cfbea51342528a4d7b262d749cbc [2019-09-20 13:00:16,929 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:00:16,930 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:00:16,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:00:16,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:00:16,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:00:16,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:00:16" (1/1) ... [2019-09-20 13:00:16,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc1d1fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:16, skipping insertion in model container [2019-09-20 13:00:16,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:00:16" (1/1) ... [2019-09-20 13:00:16,946 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:00:16,971 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:00:17,172 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:00:17,176 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:00:17,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:00:17,303 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:00:17,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:17 WrapperNode [2019-09-20 13:00:17,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:00:17,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:00:17,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:00:17,305 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:00:17,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:17" (1/1) ... [2019-09-20 13:00:17,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:17" (1/1) ... [2019-09-20 13:00:17,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:17" (1/1) ... [2019-09-20 13:00:17,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:17" (1/1) ... [2019-09-20 13:00:17,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:17" (1/1) ... [2019-09-20 13:00:17,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:17" (1/1) ... [2019-09-20 13:00:17,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:17" (1/1) ... [2019-09-20 13:00:17,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:00:17,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:00:17,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:00:17,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:00:17,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:17" (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-20 13:00:17,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:00:17,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:00:17,423 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:00:17,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:00:17,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:00:17,423 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:00:17,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:00:17,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:00:17,715 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:00:17,716 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:00:17,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:00:17 BoogieIcfgContainer [2019-09-20 13:00:17,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:00:17,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:00:17,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:00:17,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:00:17,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:00:16" (1/3) ... [2019-09-20 13:00:17,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f01f74f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:00:17, skipping insertion in model container [2019-09-20 13:00:17,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:17" (2/3) ... [2019-09-20 13:00:17,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f01f74f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:00:17, skipping insertion in model container [2019-09-20 13:00:17,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:00:17" (3/3) ... [2019-09-20 13:00:17,726 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2019-09-20 13:00:17,737 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:00:17,748 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:00:17,775 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:00:17,819 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:00:17,820 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:00:17,821 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:00:17,821 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:00:17,821 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:00:17,821 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:00:17,821 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:00:17,822 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:00:17,822 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:00:17,846 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-09-20 13:00:17,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:00:17,853 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:17,855 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-20 13:00:17,857 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:17,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:17,864 INFO L82 PathProgramCache]: Analyzing trace with hash -316470182, now seen corresponding path program 1 times [2019-09-20 13:00:17,866 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:17,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:17,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:17,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:17,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:18,071 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-20 13:00:18,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:18,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:18,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:18,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:18,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,097 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2019-09-20 13:00:18,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:18,168 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2019-09-20 13:00:18,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:18,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:00:18,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:18,184 INFO L225 Difference]: With dead ends: 93 [2019-09-20 13:00:18,184 INFO L226 Difference]: Without dead ends: 78 [2019-09-20 13:00:18,188 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-20 13:00:18,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-20 13:00:18,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2019-09-20 13:00:18,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-20 13:00:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2019-09-20 13:00:18,240 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 21 [2019-09-20 13:00:18,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:18,241 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2019-09-20 13:00:18,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:18,241 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2019-09-20 13:00:18,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:00:18,242 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:18,243 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-20 13:00:18,243 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:18,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:18,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1327587432, now seen corresponding path program 1 times [2019-09-20 13:00:18,244 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:18,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:18,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:18,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:18,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:18,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:18,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:18,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:18,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:18,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,350 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2019-09-20 13:00:18,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:18,412 INFO L93 Difference]: Finished difference Result 127 states and 232 transitions. [2019-09-20 13:00:18,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:18,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:00:18,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:18,417 INFO L225 Difference]: With dead ends: 127 [2019-09-20 13:00:18,417 INFO L226 Difference]: Without dead ends: 78 [2019-09-20 13:00:18,419 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-20 13:00:18,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-20 13:00:18,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-09-20 13:00:18,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-20 13:00:18,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2019-09-20 13:00:18,432 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 21 [2019-09-20 13:00:18,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:18,433 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2019-09-20 13:00:18,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:18,433 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2019-09-20 13:00:18,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:00:18,435 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:18,435 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:18,435 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:18,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:18,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1220427994, now seen corresponding path program 1 times [2019-09-20 13:00:18,436 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:18,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:18,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:18,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:18,485 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-20 13:00:18,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:18,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:18,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:18,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:18,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,490 INFO L87 Difference]: Start difference. First operand 76 states and 137 transitions. Second operand 3 states. [2019-09-20 13:00:18,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:18,518 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2019-09-20 13:00:18,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:18,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:00:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:18,520 INFO L225 Difference]: With dead ends: 117 [2019-09-20 13:00:18,520 INFO L226 Difference]: Without dead ends: 81 [2019-09-20 13:00:18,521 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-20 13:00:18,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-20 13:00:18,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-09-20 13:00:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-20 13:00:18,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2019-09-20 13:00:18,531 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 22 [2019-09-20 13:00:18,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:18,532 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2019-09-20 13:00:18,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:18,532 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2019-09-20 13:00:18,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:00:18,533 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:18,533 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:18,534 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:18,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:18,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1794675624, now seen corresponding path program 1 times [2019-09-20 13:00:18,534 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:18,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:18,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:18,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:18,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:18,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:18,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:18,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:18,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:18,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,588 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 3 states. [2019-09-20 13:00:18,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:18,631 INFO L93 Difference]: Finished difference Result 148 states and 264 transitions. [2019-09-20 13:00:18,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:18,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:00:18,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:18,634 INFO L225 Difference]: With dead ends: 148 [2019-09-20 13:00:18,634 INFO L226 Difference]: Without dead ends: 146 [2019-09-20 13:00:18,635 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-20 13:00:18,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-20 13:00:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2019-09-20 13:00:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-20 13:00:18,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 184 transitions. [2019-09-20 13:00:18,657 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 184 transitions. Word has length 22 [2019-09-20 13:00:18,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:18,657 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 184 transitions. [2019-09-20 13:00:18,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:18,657 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 184 transitions. [2019-09-20 13:00:18,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:00:18,662 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:18,662 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:18,663 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:18,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:18,664 INFO L82 PathProgramCache]: Analyzing trace with hash 783558374, now seen corresponding path program 1 times [2019-09-20 13:00:18,664 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:18,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:18,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:18,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:18,748 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-20 13:00:18,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:18,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:18,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:18,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:18,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,751 INFO L87 Difference]: Start difference. First operand 104 states and 184 transitions. Second operand 3 states. [2019-09-20 13:00:18,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:18,781 INFO L93 Difference]: Finished difference Result 244 states and 438 transitions. [2019-09-20 13:00:18,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:18,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:00:18,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:18,783 INFO L225 Difference]: With dead ends: 244 [2019-09-20 13:00:18,783 INFO L226 Difference]: Without dead ends: 148 [2019-09-20 13:00:18,784 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-20 13:00:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-20 13:00:18,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2019-09-20 13:00:18,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-20 13:00:18,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 258 transitions. [2019-09-20 13:00:18,797 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 258 transitions. Word has length 22 [2019-09-20 13:00:18,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:18,798 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 258 transitions. [2019-09-20 13:00:18,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:18,798 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 258 transitions. [2019-09-20 13:00:18,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:00:18,799 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:18,800 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:18,800 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:18,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:18,800 INFO L82 PathProgramCache]: Analyzing trace with hash -199417107, now seen corresponding path program 1 times [2019-09-20 13:00:18,801 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:18,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:18,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:18,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:18,844 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-20 13:00:18,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:18,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:18,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:18,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:18,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,846 INFO L87 Difference]: Start difference. First operand 146 states and 258 transitions. Second operand 3 states. [2019-09-20 13:00:18,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:18,878 INFO L93 Difference]: Finished difference Result 219 states and 385 transitions. [2019-09-20 13:00:18,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:18,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:00:18,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:18,881 INFO L225 Difference]: With dead ends: 219 [2019-09-20 13:00:18,882 INFO L226 Difference]: Without dead ends: 150 [2019-09-20 13:00:18,883 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-20 13:00:18,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-20 13:00:18,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-09-20 13:00:18,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-20 13:00:18,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2019-09-20 13:00:18,910 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 258 transitions. Word has length 23 [2019-09-20 13:00:18,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:18,910 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 258 transitions. [2019-09-20 13:00:18,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:18,911 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 258 transitions. [2019-09-20 13:00:18,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:00:18,916 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:18,917 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:18,917 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:18,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:18,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1479280785, now seen corresponding path program 1 times [2019-09-20 13:00:18,918 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:18,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:18,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:18,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:18,986 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-20 13:00:18,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:18,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:18,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:18,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:18,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,988 INFO L87 Difference]: Start difference. First operand 148 states and 258 transitions. Second operand 3 states. [2019-09-20 13:00:19,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,010 INFO L93 Difference]: Finished difference Result 276 states and 488 transitions. [2019-09-20 13:00:19,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:00:19,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,013 INFO L225 Difference]: With dead ends: 276 [2019-09-20 13:00:19,013 INFO L226 Difference]: Without dead ends: 274 [2019-09-20 13:00:19,014 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-20 13:00:19,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-20 13:00:19,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 200. [2019-09-20 13:00:19,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-20 13:00:19,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 346 transitions. [2019-09-20 13:00:19,027 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 346 transitions. Word has length 23 [2019-09-20 13:00:19,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,028 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 346 transitions. [2019-09-20 13:00:19,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,028 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 346 transitions. [2019-09-20 13:00:19,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:00:19,030 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,030 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:19,030 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1804569261, now seen corresponding path program 1 times [2019-09-20 13:00:19,031 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,060 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-20 13:00:19,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,062 INFO L87 Difference]: Start difference. First operand 200 states and 346 transitions. Second operand 3 states. [2019-09-20 13:00:19,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,107 INFO L93 Difference]: Finished difference Result 472 states and 824 transitions. [2019-09-20 13:00:19,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:00:19,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,109 INFO L225 Difference]: With dead ends: 472 [2019-09-20 13:00:19,109 INFO L226 Difference]: Without dead ends: 282 [2019-09-20 13:00:19,111 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-20 13:00:19,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-20 13:00:19,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2019-09-20 13:00:19,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-20 13:00:19,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 482 transitions. [2019-09-20 13:00:19,124 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 482 transitions. Word has length 23 [2019-09-20 13:00:19,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,124 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 482 transitions. [2019-09-20 13:00:19,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,124 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 482 transitions. [2019-09-20 13:00:19,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:00:19,126 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,126 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:19,126 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1387149659, now seen corresponding path program 1 times [2019-09-20 13:00:19,127 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,154 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-20 13:00:19,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,156 INFO L87 Difference]: Start difference. First operand 280 states and 482 transitions. Second operand 3 states. [2019-09-20 13:00:19,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,182 INFO L93 Difference]: Finished difference Result 420 states and 720 transitions. [2019-09-20 13:00:19,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:00:19,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,185 INFO L225 Difference]: With dead ends: 420 [2019-09-20 13:00:19,186 INFO L226 Difference]: Without dead ends: 286 [2019-09-20 13:00:19,187 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-20 13:00:19,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-20 13:00:19,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2019-09-20 13:00:19,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-09-20 13:00:19,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 482 transitions. [2019-09-20 13:00:19,207 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 482 transitions. Word has length 24 [2019-09-20 13:00:19,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,210 INFO L475 AbstractCegarLoop]: Abstraction has 284 states and 482 transitions. [2019-09-20 13:00:19,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,210 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 482 transitions. [2019-09-20 13:00:19,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:00:19,211 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,212 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:19,212 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,212 INFO L82 PathProgramCache]: Analyzing trace with hash 107285981, now seen corresponding path program 1 times [2019-09-20 13:00:19,213 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,272 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-20 13:00:19,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,274 INFO L87 Difference]: Start difference. First operand 284 states and 482 transitions. Second operand 3 states. [2019-09-20 13:00:19,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,309 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2019-09-20 13:00:19,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:00:19,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,317 INFO L225 Difference]: With dead ends: 524 [2019-09-20 13:00:19,318 INFO L226 Difference]: Without dead ends: 522 [2019-09-20 13:00:19,318 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-20 13:00:19,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-09-20 13:00:19,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 392. [2019-09-20 13:00:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-20 13:00:19,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 654 transitions. [2019-09-20 13:00:19,337 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 654 transitions. Word has length 24 [2019-09-20 13:00:19,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,338 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 654 transitions. [2019-09-20 13:00:19,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,338 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 654 transitions. [2019-09-20 13:00:19,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:00:19,339 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,340 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:19,341 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,341 INFO L82 PathProgramCache]: Analyzing trace with hash -903831269, now seen corresponding path program 1 times [2019-09-20 13:00:19,341 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,379 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-20 13:00:19,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,381 INFO L87 Difference]: Start difference. First operand 392 states and 654 transitions. Second operand 3 states. [2019-09-20 13:00:19,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,419 INFO L93 Difference]: Finished difference Result 924 states and 1552 transitions. [2019-09-20 13:00:19,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:00:19,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,424 INFO L225 Difference]: With dead ends: 924 [2019-09-20 13:00:19,424 INFO L226 Difference]: Without dead ends: 546 [2019-09-20 13:00:19,426 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-20 13:00:19,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-09-20 13:00:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2019-09-20 13:00:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-09-20 13:00:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 902 transitions. [2019-09-20 13:00:19,447 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 902 transitions. Word has length 24 [2019-09-20 13:00:19,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,448 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 902 transitions. [2019-09-20 13:00:19,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,448 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 902 transitions. [2019-09-20 13:00:19,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:00:19,451 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,452 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:19,452 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,453 INFO L82 PathProgramCache]: Analyzing trace with hash -968887806, now seen corresponding path program 1 times [2019-09-20 13:00:19,453 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,488 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-20 13:00:19,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,491 INFO L87 Difference]: Start difference. First operand 544 states and 902 transitions. Second operand 3 states. [2019-09-20 13:00:19,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,518 INFO L93 Difference]: Finished difference Result 816 states and 1348 transitions. [2019-09-20 13:00:19,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:00:19,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,522 INFO L225 Difference]: With dead ends: 816 [2019-09-20 13:00:19,522 INFO L226 Difference]: Without dead ends: 554 [2019-09-20 13:00:19,524 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-20 13:00:19,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-09-20 13:00:19,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2019-09-20 13:00:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-09-20 13:00:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 902 transitions. [2019-09-20 13:00:19,543 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 902 transitions. Word has length 25 [2019-09-20 13:00:19,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,543 INFO L475 AbstractCegarLoop]: Abstraction has 552 states and 902 transitions. [2019-09-20 13:00:19,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,544 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 902 transitions. [2019-09-20 13:00:19,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:00:19,545 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,545 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:19,545 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,546 INFO L82 PathProgramCache]: Analyzing trace with hash 2046215812, now seen corresponding path program 1 times [2019-09-20 13:00:19,546 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:19,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,577 INFO L87 Difference]: Start difference. First operand 552 states and 902 transitions. Second operand 3 states. [2019-09-20 13:00:19,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,602 INFO L93 Difference]: Finished difference Result 1004 states and 1672 transitions. [2019-09-20 13:00:19,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:00:19,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,608 INFO L225 Difference]: With dead ends: 1004 [2019-09-20 13:00:19,608 INFO L226 Difference]: Without dead ends: 1002 [2019-09-20 13:00:19,609 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-20 13:00:19,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-09-20 13:00:19,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 776. [2019-09-20 13:00:19,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-09-20 13:00:19,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1238 transitions. [2019-09-20 13:00:19,635 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1238 transitions. Word has length 25 [2019-09-20 13:00:19,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,635 INFO L475 AbstractCegarLoop]: Abstraction has 776 states and 1238 transitions. [2019-09-20 13:00:19,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,635 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1238 transitions. [2019-09-20 13:00:19,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:00:19,637 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,637 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:19,637 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1035098562, now seen corresponding path program 1 times [2019-09-20 13:00:19,638 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,672 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-20 13:00:19,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,674 INFO L87 Difference]: Start difference. First operand 776 states and 1238 transitions. Second operand 3 states. [2019-09-20 13:00:19,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,708 INFO L93 Difference]: Finished difference Result 1820 states and 2920 transitions. [2019-09-20 13:00:19,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:00:19,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,714 INFO L225 Difference]: With dead ends: 1820 [2019-09-20 13:00:19,714 INFO L226 Difference]: Without dead ends: 1066 [2019-09-20 13:00:19,716 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-09-20 13:00:19,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1064. [2019-09-20 13:00:19,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2019-09-20 13:00:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1686 transitions. [2019-09-20 13:00:19,748 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1686 transitions. Word has length 25 [2019-09-20 13:00:19,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,748 INFO L475 AbstractCegarLoop]: Abstraction has 1064 states and 1686 transitions. [2019-09-20 13:00:19,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1686 transitions. [2019-09-20 13:00:19,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:00:19,751 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,751 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:19,751 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,751 INFO L82 PathProgramCache]: Analyzing trace with hash -991604848, now seen corresponding path program 1 times [2019-09-20 13:00:19,752 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,772 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-20 13:00:19,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,773 INFO L87 Difference]: Start difference. First operand 1064 states and 1686 transitions. Second operand 3 states. [2019-09-20 13:00:19,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,803 INFO L93 Difference]: Finished difference Result 1596 states and 2520 transitions. [2019-09-20 13:00:19,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:00:19,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,811 INFO L225 Difference]: With dead ends: 1596 [2019-09-20 13:00:19,811 INFO L226 Difference]: Without dead ends: 1082 [2019-09-20 13:00:19,813 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-20 13:00:19,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-20 13:00:19,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2019-09-20 13:00:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2019-09-20 13:00:19,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1686 transitions. [2019-09-20 13:00:19,856 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1686 transitions. Word has length 26 [2019-09-20 13:00:19,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,857 INFO L475 AbstractCegarLoop]: Abstraction has 1080 states and 1686 transitions. [2019-09-20 13:00:19,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1686 transitions. [2019-09-20 13:00:19,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:00:19,860 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,860 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:19,860 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2023498770, now seen corresponding path program 1 times [2019-09-20 13:00:19,861 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,884 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-20 13:00:19,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,886 INFO L87 Difference]: Start difference. First operand 1080 states and 1686 transitions. Second operand 3 states. [2019-09-20 13:00:19,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,945 INFO L93 Difference]: Finished difference Result 1932 states and 3080 transitions. [2019-09-20 13:00:19,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:00:19,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,955 INFO L225 Difference]: With dead ends: 1932 [2019-09-20 13:00:19,955 INFO L226 Difference]: Without dead ends: 1930 [2019-09-20 13:00:19,956 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-20 13:00:19,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-09-20 13:00:20,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1544. [2019-09-20 13:00:20,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-09-20 13:00:20,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2342 transitions. [2019-09-20 13:00:20,013 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2342 transitions. Word has length 26 [2019-09-20 13:00:20,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,013 INFO L475 AbstractCegarLoop]: Abstraction has 1544 states and 2342 transitions. [2019-09-20 13:00:20,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:20,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2342 transitions. [2019-09-20 13:00:20,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:00:20,018 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,018 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:20,019 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1012381520, now seen corresponding path program 1 times [2019-09-20 13:00:20,019 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,048 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-20 13:00:20,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:20,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:20,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:20,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,050 INFO L87 Difference]: Start difference. First operand 1544 states and 2342 transitions. Second operand 3 states. [2019-09-20 13:00:20,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,100 INFO L93 Difference]: Finished difference Result 3596 states and 5480 transitions. [2019-09-20 13:00:20,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:20,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:00:20,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,112 INFO L225 Difference]: With dead ends: 3596 [2019-09-20 13:00:20,112 INFO L226 Difference]: Without dead ends: 2090 [2019-09-20 13:00:20,116 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-20 13:00:20,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2019-09-20 13:00:20,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2019-09-20 13:00:20,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2019-09-20 13:00:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3142 transitions. [2019-09-20 13:00:20,185 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3142 transitions. Word has length 26 [2019-09-20 13:00:20,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,186 INFO L475 AbstractCegarLoop]: Abstraction has 2088 states and 3142 transitions. [2019-09-20 13:00:20,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:20,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3142 transitions. [2019-09-20 13:00:20,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:00:20,189 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,189 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:20,189 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1695832809, now seen corresponding path program 1 times [2019-09-20 13:00:20,190 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,207 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-20 13:00:20,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:20,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:20,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:20,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,208 INFO L87 Difference]: Start difference. First operand 2088 states and 3142 transitions. Second operand 3 states. [2019-09-20 13:00:20,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,252 INFO L93 Difference]: Finished difference Result 3132 states and 4696 transitions. [2019-09-20 13:00:20,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:20,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:00:20,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,263 INFO L225 Difference]: With dead ends: 3132 [2019-09-20 13:00:20,263 INFO L226 Difference]: Without dead ends: 2122 [2019-09-20 13:00:20,266 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-20 13:00:20,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2019-09-20 13:00:20,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2019-09-20 13:00:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2019-09-20 13:00:20,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3142 transitions. [2019-09-20 13:00:20,335 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3142 transitions. Word has length 27 [2019-09-20 13:00:20,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,335 INFO L475 AbstractCegarLoop]: Abstraction has 2120 states and 3142 transitions. [2019-09-20 13:00:20,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:20,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3142 transitions. [2019-09-20 13:00:20,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:00:20,339 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,339 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:20,339 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1319270809, now seen corresponding path program 1 times [2019-09-20 13:00:20,340 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,358 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-20 13:00:20,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:20,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:20,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:20,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,359 INFO L87 Difference]: Start difference. First operand 2120 states and 3142 transitions. Second operand 3 states. [2019-09-20 13:00:20,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,432 INFO L93 Difference]: Finished difference Result 3724 states and 5640 transitions. [2019-09-20 13:00:20,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:20,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:00:20,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,451 INFO L225 Difference]: With dead ends: 3724 [2019-09-20 13:00:20,451 INFO L226 Difference]: Without dead ends: 3722 [2019-09-20 13:00:20,454 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-20 13:00:20,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-09-20 13:00:20,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3080. [2019-09-20 13:00:20,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2019-09-20 13:00:20,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4422 transitions. [2019-09-20 13:00:20,548 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4422 transitions. Word has length 27 [2019-09-20 13:00:20,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,548 INFO L475 AbstractCegarLoop]: Abstraction has 3080 states and 4422 transitions. [2019-09-20 13:00:20,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:20,549 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4422 transitions. [2019-09-20 13:00:20,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:00:20,555 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,555 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:20,555 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,555 INFO L82 PathProgramCache]: Analyzing trace with hash 308153559, now seen corresponding path program 1 times [2019-09-20 13:00:20,556 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:20,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:20,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:20,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:20,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,578 INFO L87 Difference]: Start difference. First operand 3080 states and 4422 transitions. Second operand 3 states. [2019-09-20 13:00:20,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,689 INFO L93 Difference]: Finished difference Result 7116 states and 10248 transitions. [2019-09-20 13:00:20,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:20,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:00:20,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,709 INFO L225 Difference]: With dead ends: 7116 [2019-09-20 13:00:20,709 INFO L226 Difference]: Without dead ends: 4106 [2019-09-20 13:00:20,715 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-20 13:00:20,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2019-09-20 13:00:20,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4104. [2019-09-20 13:00:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2019-09-20 13:00:20,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 5830 transitions. [2019-09-20 13:00:20,832 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 5830 transitions. Word has length 27 [2019-09-20 13:00:20,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,832 INFO L475 AbstractCegarLoop]: Abstraction has 4104 states and 5830 transitions. [2019-09-20 13:00:20,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:20,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 5830 transitions. [2019-09-20 13:00:20,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:00:20,838 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,838 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:20,838 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,839 INFO L82 PathProgramCache]: Analyzing trace with hash -2052062779, now seen corresponding path program 1 times [2019-09-20 13:00:20,839 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,864 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-20 13:00:20,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:20,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:20,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:20,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,866 INFO L87 Difference]: Start difference. First operand 4104 states and 5830 transitions. Second operand 3 states. [2019-09-20 13:00:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,941 INFO L93 Difference]: Finished difference Result 6156 states and 8712 transitions. [2019-09-20 13:00:20,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:20,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:00:20,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,983 INFO L225 Difference]: With dead ends: 6156 [2019-09-20 13:00:20,983 INFO L226 Difference]: Without dead ends: 4170 [2019-09-20 13:00:20,997 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-20 13:00:21,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2019-09-20 13:00:21,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4168. [2019-09-20 13:00:21,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2019-09-20 13:00:21,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5830 transitions. [2019-09-20 13:00:21,130 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5830 transitions. Word has length 28 [2019-09-20 13:00:21,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:21,131 INFO L475 AbstractCegarLoop]: Abstraction has 4168 states and 5830 transitions. [2019-09-20 13:00:21,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:21,131 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5830 transitions. [2019-09-20 13:00:21,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:00:21,137 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:21,137 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:21,137 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:21,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:21,138 INFO L82 PathProgramCache]: Analyzing trace with hash 963040839, now seen corresponding path program 1 times [2019-09-20 13:00:21,138 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:21,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:21,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:21,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:21,161 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-20 13:00:21,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:21,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:21,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:21,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:21,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:21,163 INFO L87 Difference]: Start difference. First operand 4168 states and 5830 transitions. Second operand 3 states. [2019-09-20 13:00:21,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:21,312 INFO L93 Difference]: Finished difference Result 12108 states and 16712 transitions. [2019-09-20 13:00:21,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:21,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:00:21,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:21,333 INFO L225 Difference]: With dead ends: 12108 [2019-09-20 13:00:21,333 INFO L226 Difference]: Without dead ends: 8074 [2019-09-20 13:00:21,341 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-20 13:00:21,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2019-09-20 13:00:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2019-09-20 13:00:21,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2019-09-20 13:00:21,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10886 transitions. [2019-09-20 13:00:21,582 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10886 transitions. Word has length 28 [2019-09-20 13:00:21,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:21,582 INFO L475 AbstractCegarLoop]: Abstraction has 8072 states and 10886 transitions. [2019-09-20 13:00:21,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:21,583 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10886 transitions. [2019-09-20 13:00:21,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:00:21,597 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:21,597 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:21,597 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:21,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:21,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1974158089, now seen corresponding path program 1 times [2019-09-20 13:00:21,598 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:21,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:21,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:21,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:21,622 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-20 13:00:21,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:21,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:21,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:21,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:21,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:21,624 INFO L87 Difference]: Start difference. First operand 8072 states and 10886 transitions. Second operand 3 states. [2019-09-20 13:00:21,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:21,804 INFO L93 Difference]: Finished difference Result 9100 states and 12680 transitions. [2019-09-20 13:00:21,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:21,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:00:21,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:21,833 INFO L225 Difference]: With dead ends: 9100 [2019-09-20 13:00:21,833 INFO L226 Difference]: Without dead ends: 9098 [2019-09-20 13:00:21,838 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-20 13:00:21,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2019-09-20 13:00:22,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 8072. [2019-09-20 13:00:22,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2019-09-20 13:00:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10758 transitions. [2019-09-20 13:00:22,169 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10758 transitions. Word has length 28 [2019-09-20 13:00:22,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,169 INFO L475 AbstractCegarLoop]: Abstraction has 8072 states and 10758 transitions. [2019-09-20 13:00:22,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10758 transitions. [2019-09-20 13:00:22,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:00:22,183 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,183 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:22,184 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,184 INFO L82 PathProgramCache]: Analyzing trace with hash -210289620, now seen corresponding path program 1 times [2019-09-20 13:00:22,184 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,210 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-20 13:00:22,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,212 INFO L87 Difference]: Start difference. First operand 8072 states and 10758 transitions. Second operand 3 states. [2019-09-20 13:00:22,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:22,444 INFO L93 Difference]: Finished difference Result 13708 states and 18568 transitions. [2019-09-20 13:00:22,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:22,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:00:22,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:22,472 INFO L225 Difference]: With dead ends: 13708 [2019-09-20 13:00:22,472 INFO L226 Difference]: Without dead ends: 13706 [2019-09-20 13:00:22,476 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-20 13:00:22,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13706 states. [2019-09-20 13:00:22,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13706 to 12168. [2019-09-20 13:00:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2019-09-20 13:00:22,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 15750 transitions. [2019-09-20 13:00:22,770 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 15750 transitions. Word has length 29 [2019-09-20 13:00:22,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,770 INFO L475 AbstractCegarLoop]: Abstraction has 12168 states and 15750 transitions. [2019-09-20 13:00:22,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,771 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 15750 transitions. [2019-09-20 13:00:22,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:00:22,793 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,793 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:22,794 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1221406870, now seen corresponding path program 1 times [2019-09-20 13:00:22,794 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,814 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-20 13:00:22,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,816 INFO L87 Difference]: Start difference. First operand 12168 states and 15750 transitions. Second operand 3 states. [2019-09-20 13:00:23,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:23,119 INFO L93 Difference]: Finished difference Result 27788 states and 35976 transitions. [2019-09-20 13:00:23,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:23,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:00:23,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:23,152 INFO L225 Difference]: With dead ends: 27788 [2019-09-20 13:00:23,152 INFO L226 Difference]: Without dead ends: 15754 [2019-09-20 13:00:23,171 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-20 13:00:23,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15754 states. [2019-09-20 13:00:23,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15754 to 15752. [2019-09-20 13:00:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2019-09-20 13:00:23,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 19974 transitions. [2019-09-20 13:00:23,582 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 19974 transitions. Word has length 29 [2019-09-20 13:00:23,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:23,583 INFO L475 AbstractCegarLoop]: Abstraction has 15752 states and 19974 transitions. [2019-09-20 13:00:23,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:23,583 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 19974 transitions. [2019-09-20 13:00:23,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:00:23,602 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:23,602 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:23,602 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:23,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:23,602 INFO L82 PathProgramCache]: Analyzing trace with hash 2071172156, now seen corresponding path program 1 times [2019-09-20 13:00:23,603 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:23,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:23,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:23,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:23,632 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-20 13:00:23,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:23,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:23,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:23,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:23,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,634 INFO L87 Difference]: Start difference. First operand 15752 states and 19974 transitions. Second operand 3 states. [2019-09-20 13:00:23,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:23,838 INFO L93 Difference]: Finished difference Result 23820 states and 30216 transitions. [2019-09-20 13:00:23,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:23,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:00:23,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:23,871 INFO L225 Difference]: With dead ends: 23820 [2019-09-20 13:00:23,871 INFO L226 Difference]: Without dead ends: 16138 [2019-09-20 13:00:23,889 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-20 13:00:23,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16138 states. [2019-09-20 13:00:24,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16138 to 16136. [2019-09-20 13:00:24,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16136 states. [2019-09-20 13:00:24,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 20230 transitions. [2019-09-20 13:00:24,357 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 20230 transitions. Word has length 30 [2019-09-20 13:00:24,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:24,358 INFO L475 AbstractCegarLoop]: Abstraction has 16136 states and 20230 transitions. [2019-09-20 13:00:24,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 20230 transitions. [2019-09-20 13:00:24,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:00:24,378 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:24,378 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:24,378 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:24,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:24,379 INFO L82 PathProgramCache]: Analyzing trace with hash 791308478, now seen corresponding path program 1 times [2019-09-20 13:00:24,379 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:24,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:24,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:24,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:24,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:24,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:24,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:24,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:24,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:24,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:24,400 INFO L87 Difference]: Start difference. First operand 16136 states and 20230 transitions. Second operand 3 states. [2019-09-20 13:00:24,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:24,693 INFO L93 Difference]: Finished difference Result 26636 states and 33544 transitions. [2019-09-20 13:00:24,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:24,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:00:24,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:24,751 INFO L225 Difference]: With dead ends: 26636 [2019-09-20 13:00:24,752 INFO L226 Difference]: Without dead ends: 26634 [2019-09-20 13:00:24,762 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-20 13:00:24,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26634 states. [2019-09-20 13:00:25,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26634 to 24584. [2019-09-20 13:00:25,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24584 states. [2019-09-20 13:00:25,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24584 states to 24584 states and 29958 transitions. [2019-09-20 13:00:25,712 INFO L78 Accepts]: Start accepts. Automaton has 24584 states and 29958 transitions. Word has length 30 [2019-09-20 13:00:25,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:25,712 INFO L475 AbstractCegarLoop]: Abstraction has 24584 states and 29958 transitions. [2019-09-20 13:00:25,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:25,712 INFO L276 IsEmpty]: Start isEmpty. Operand 24584 states and 29958 transitions. [2019-09-20 13:00:25,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:00:25,756 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:25,756 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:25,756 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:25,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:25,757 INFO L82 PathProgramCache]: Analyzing trace with hash -219808772, now seen corresponding path program 1 times [2019-09-20 13:00:25,757 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:25,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:25,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:25,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:25,780 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-20 13:00:25,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:25,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:25,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:25,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:25,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,781 INFO L87 Difference]: Start difference. First operand 24584 states and 29958 transitions. Second operand 3 states. [2019-09-20 13:00:26,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,155 INFO L93 Difference]: Finished difference Result 55308 states and 66824 transitions. [2019-09-20 13:00:26,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:00:26,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,215 INFO L225 Difference]: With dead ends: 55308 [2019-09-20 13:00:26,216 INFO L226 Difference]: Without dead ends: 31242 [2019-09-20 13:00:26,263 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-20 13:00:26,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31242 states. [2019-09-20 13:00:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31242 to 31240. [2019-09-20 13:00:26,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31240 states. [2019-09-20 13:00:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31240 states to 31240 states and 36870 transitions. [2019-09-20 13:00:26,999 INFO L78 Accepts]: Start accepts. Automaton has 31240 states and 36870 transitions. Word has length 30 [2019-09-20 13:00:26,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,999 INFO L475 AbstractCegarLoop]: Abstraction has 31240 states and 36870 transitions. [2019-09-20 13:00:26,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,999 INFO L276 IsEmpty]: Start isEmpty. Operand 31240 states and 36870 transitions. [2019-09-20 13:00:27,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:00:27,041 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:27,041 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:27,041 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:27,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:27,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1239024833, now seen corresponding path program 1 times [2019-09-20 13:00:27,042 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:27,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:27,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:27,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:27,068 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-20 13:00:27,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:27,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:27,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:27,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:27,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,070 INFO L87 Difference]: Start difference. First operand 31240 states and 36870 transitions. Second operand 3 states. [2019-09-20 13:00:28,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:28,064 INFO L93 Difference]: Finished difference Result 46860 states and 55048 transitions. [2019-09-20 13:00:28,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:28,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 13:00:28,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:28,123 INFO L225 Difference]: With dead ends: 46860 [2019-09-20 13:00:28,123 INFO L226 Difference]: Without dead ends: 31754 [2019-09-20 13:00:28,151 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-20 13:00:28,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31754 states. [2019-09-20 13:00:28,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31754 to 31752. [2019-09-20 13:00:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31752 states. [2019-09-20 13:00:28,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31752 states to 31752 states and 36870 transitions. [2019-09-20 13:00:28,748 INFO L78 Accepts]: Start accepts. Automaton has 31752 states and 36870 transitions. Word has length 31 [2019-09-20 13:00:28,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:28,748 INFO L475 AbstractCegarLoop]: Abstraction has 31752 states and 36870 transitions. [2019-09-20 13:00:28,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:28,749 INFO L276 IsEmpty]: Start isEmpty. Operand 31752 states and 36870 transitions. [2019-09-20 13:00:28,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:00:28,779 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:28,779 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:28,779 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:28,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:28,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1776078785, now seen corresponding path program 1 times [2019-09-20 13:00:28,782 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:28,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:28,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:28,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:28,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:28,801 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-20 13:00:28,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:28,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:28,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:28,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:28,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:28,802 INFO L87 Difference]: Start difference. First operand 31752 states and 36870 transitions. Second operand 3 states. [2019-09-20 13:00:29,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:29,431 INFO L93 Difference]: Finished difference Result 51210 states and 58887 transitions. [2019-09-20 13:00:29,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:29,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 13:00:29,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:29,543 INFO L225 Difference]: With dead ends: 51210 [2019-09-20 13:00:29,543 INFO L226 Difference]: Without dead ends: 51208 [2019-09-20 13:00:29,551 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-20 13:00:29,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51208 states. [2019-09-20 13:00:30,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51208 to 49160. [2019-09-20 13:00:30,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49160 states. [2019-09-20 13:00:30,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49160 states to 49160 states and 55814 transitions. [2019-09-20 13:00:30,350 INFO L78 Accepts]: Start accepts. Automaton has 49160 states and 55814 transitions. Word has length 31 [2019-09-20 13:00:30,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:30,351 INFO L475 AbstractCegarLoop]: Abstraction has 49160 states and 55814 transitions. [2019-09-20 13:00:30,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:30,351 INFO L276 IsEmpty]: Start isEmpty. Operand 49160 states and 55814 transitions. [2019-09-20 13:00:30,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:00:30,402 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:30,402 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:30,402 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:30,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:30,403 INFO L82 PathProgramCache]: Analyzing trace with hash 764961535, now seen corresponding path program 1 times [2019-09-20 13:00:30,403 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:30,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:30,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:30,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:30,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:30,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:30,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:30,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:30,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:30,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:30,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:30,422 INFO L87 Difference]: Start difference. First operand 49160 states and 55814 transitions. Second operand 3 states. [2019-09-20 13:00:31,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:31,264 INFO L93 Difference]: Finished difference Result 109576 states and 122374 transitions. [2019-09-20 13:00:31,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:31,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 13:00:31,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:31,265 INFO L225 Difference]: With dead ends: 109576 [2019-09-20 13:00:31,265 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:00:31,363 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-20 13:00:31,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:00:31,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:00:31,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:00:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:00:31,365 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-09-20 13:00:31,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:31,365 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:00:31,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:31,365 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:00:31,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:00:31,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-20 13:00:31,395 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-20 13:00:31,396 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-20 13:00:31,396 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-20 13:00:31,396 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-20 13:00:31,396 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-20 13:00:31,396 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-20 13:00:31,397 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2019-09-20 13:00:31,397 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed. [2019-09-20 13:00:31,397 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-09-20 13:00:31,397 INFO L443 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2019-09-20 13:00:31,397 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-09-20 13:00:31,397 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-09-20 13:00:31,397 INFO L439 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2019-09-20 13:00:31,398 INFO L443 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2019-09-20 13:00:31,398 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2019-09-20 13:00:31,398 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2019-09-20 13:00:31,398 INFO L443 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2019-09-20 13:00:31,398 INFO L443 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2019-09-20 13:00:31,398 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2019-09-20 13:00:31,398 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-09-20 13:00:31,398 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2019-09-20 13:00:31,399 INFO L443 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2019-09-20 13:00:31,399 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed. [2019-09-20 13:00:31,399 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2019-09-20 13:00:31,399 INFO L443 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2019-09-20 13:00:31,399 INFO L443 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2019-09-20 13:00:31,399 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2019-09-20 13:00:31,399 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true [2019-09-20 13:00:31,399 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-09-20 13:00:31,400 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-09-20 13:00:31,400 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2019-09-20 13:00:31,400 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2019-09-20 13:00:31,400 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-09-20 13:00:31,400 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-09-20 13:00:31,400 INFO L446 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2019-09-20 13:00:31,400 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2019-09-20 13:00:31,400 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2019-09-20 13:00:31,401 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2019-09-20 13:00:31,401 INFO L443 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2019-09-20 13:00:31,401 INFO L443 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2019-09-20 13:00:31,401 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2019-09-20 13:00:31,401 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2019-09-20 13:00:31,401 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-09-20 13:00:31,401 INFO L443 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2019-09-20 13:00:31,401 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2019-09-20 13:00:31,402 INFO L443 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2019-09-20 13:00:31,402 INFO L446 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2019-09-20 13:00:31,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:00:31 BoogieIcfgContainer [2019-09-20 13:00:31,410 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:00:31,413 INFO L168 Benchmark]: Toolchain (without parser) took 14482.01 ms. Allocated memory was 131.1 MB in the beginning and 1.1 GB in the end (delta: 966.3 MB). Free memory was 86.9 MB in the beginning and 546.3 MB in the end (delta: -459.4 MB). Peak memory consumption was 506.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:31,414 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 131.1 MB. Free memory was 105.2 MB in the beginning and 105.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:00:31,415 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.04 ms. Allocated memory was 131.1 MB in the beginning and 199.8 MB in the end (delta: 68.7 MB). Free memory was 86.5 MB in the beginning and 177.0 MB in the end (delta: -90.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:31,416 INFO L168 Benchmark]: Boogie Preprocessor took 51.32 ms. Allocated memory is still 199.8 MB. Free memory was 177.0 MB in the beginning and 174.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:31,416 INFO L168 Benchmark]: RCFGBuilder took 361.38 ms. Allocated memory is still 199.8 MB. Free memory was 174.6 MB in the beginning and 154.7 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:31,417 INFO L168 Benchmark]: TraceAbstraction took 13691.48 ms. Allocated memory was 199.8 MB in the beginning and 1.1 GB in the end (delta: 897.6 MB). Free memory was 154.0 MB in the beginning and 546.3 MB in the end (delta: -392.3 MB). Peak memory consumption was 505.3 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:31,421 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.24 ms. Allocated memory is still 131.1 MB. Free memory was 105.2 MB in the beginning and 105.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 373.04 ms. Allocated memory was 131.1 MB in the beginning and 199.8 MB in the end (delta: 68.7 MB). Free memory was 86.5 MB in the beginning and 177.0 MB in the end (delta: -90.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.32 ms. Allocated memory is still 199.8 MB. Free memory was 177.0 MB in the beginning and 174.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 361.38 ms. Allocated memory is still 199.8 MB. Free memory was 174.6 MB in the beginning and 154.7 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13691.48 ms. Allocated memory was 199.8 MB in the beginning and 1.1 GB in the end (delta: 897.6 MB). Free memory was 154.0 MB in the beginning and 546.3 MB in the end (delta: -392.3 MB). Peak memory consumption was 505.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. SAFE Result, 13.6s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 6.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2877 SDtfs, 1405 SDslu, 1967 SDs, 0 SdLazy, 165 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49160occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 8224 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 2058 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 777 ConstructedInterpolants, 0 QuantifiedInterpolants, 39912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...