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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/locks/test_locks_10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:04:33,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:04:33,877 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:04:33,896 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:04:33,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:04:33,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:04:33,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:04:33,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:04:33,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:04:33,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:04:33,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:04:33,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:04:33,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:04:33,927 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:04:33,929 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:04:33,932 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:04:33,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:04:33,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:04:33,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:04:33,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:04:33,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:04:33,947 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:04:33,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:04:33,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:04:33,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:04:33,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:04:33,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:04:33,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:04:33,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:04:33,959 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:04:33,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:04:33,961 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:04:33,962 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:04:33,963 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:04:33,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:04:33,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:04:33,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:04:33,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:04:33,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:04:33,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:04:33,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:04:33,971 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-16 17:04:33,993 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:04:33,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:04:33,995 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:04:33,995 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:04:33,995 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:04:33,996 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:04:33,996 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:04:33,996 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:04:33,996 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:04:33,997 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:04:33,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:04:33,999 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:04:33,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:04:34,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:04:34,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:04:34,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:04:34,000 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:04:34,001 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:04:34,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:04:34,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:04:34,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:04:34,001 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:04:34,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:04:34,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:34,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:04:34,002 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:04:34,003 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:04:34,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:04:34,003 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:04:34,003 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:04:34,058 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:04:34,079 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:04:34,083 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:04:34,085 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:04:34,085 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:04:34,086 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2019-09-16 17:04:34,146 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4346763/e95bda9101ad4b7a9f077d06b98077f3/FLAG19b4d8c61 [2019-09-16 17:04:34,625 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:04:34,626 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2019-09-16 17:04:34,637 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4346763/e95bda9101ad4b7a9f077d06b98077f3/FLAG19b4d8c61 [2019-09-16 17:04:34,995 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4346763/e95bda9101ad4b7a9f077d06b98077f3 [2019-09-16 17:04:35,004 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:04:35,006 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:04:35,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:35,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:04:35,011 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:04:35,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:34" (1/1) ... [2019-09-16 17:04:35,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@af9c1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:35, skipping insertion in model container [2019-09-16 17:04:35,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:34" (1/1) ... [2019-09-16 17:04:35,023 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:04:35,046 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:04:35,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:35,227 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:04:35,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:35,356 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:04:35,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:35 WrapperNode [2019-09-16 17:04:35,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:35,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:04:35,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:04:35,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:04:35,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:35" (1/1) ... [2019-09-16 17:04:35,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:35" (1/1) ... [2019-09-16 17:04:35,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:35" (1/1) ... [2019-09-16 17:04:35,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:35" (1/1) ... [2019-09-16 17:04:35,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:35" (1/1) ... [2019-09-16 17:04:35,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:35" (1/1) ... [2019-09-16 17:04:35,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:35" (1/1) ... [2019-09-16 17:04:35,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:04:35,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:04:35,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:04:35,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:04:35,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:35,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:04:35,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:04:35,475 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:04:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:04:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:04:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:04:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:04:35,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:04:35,816 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:04:35,816 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:04:35,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:35 BoogieIcfgContainer [2019-09-16 17:04:35,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:04:35,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:04:35,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:04:35,822 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:04:35,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:04:34" (1/3) ... [2019-09-16 17:04:35,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef74a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:35, skipping insertion in model container [2019-09-16 17:04:35,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:35" (2/3) ... [2019-09-16 17:04:35,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef74a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:35, skipping insertion in model container [2019-09-16 17:04:35,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:35" (3/3) ... [2019-09-16 17:04:35,825 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2019-09-16 17:04:35,832 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:04:35,838 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:04:35,852 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:04:35,878 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:04:35,879 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:04:35,879 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:04:35,879 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:04:35,879 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:04:35,879 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:04:35,879 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:04:35,879 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:04:35,895 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-09-16 17:04:35,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 17:04:35,904 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:35,905 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:35,907 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:35,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:35,912 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2019-09-16 17:04:35,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:35,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:35,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:35,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:35,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:36,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:36,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:36,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:36,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:36,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:36,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:36,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:36,130 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-09-16 17:04:36,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:36,212 INFO L93 Difference]: Finished difference Result 80 states and 137 transitions. [2019-09-16 17:04:36,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:36,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-16 17:04:36,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:36,232 INFO L225 Difference]: With dead ends: 80 [2019-09-16 17:04:36,232 INFO L226 Difference]: Without dead ends: 72 [2019-09-16 17:04:36,236 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:36,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-16 17:04:36,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-09-16 17:04:36,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-16 17:04:36,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2019-09-16 17:04:36,303 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2019-09-16 17:04:36,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:36,304 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2019-09-16 17:04:36,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:36,305 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2019-09-16 17:04:36,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 17:04:36,307 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:36,307 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:36,309 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:36,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:36,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2019-09-16 17:04:36,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:36,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:36,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:36,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:36,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:36,405 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:36,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:36,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:36,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:36,407 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2019-09-16 17:04:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:36,455 INFO L93 Difference]: Finished difference Result 72 states and 126 transitions. [2019-09-16 17:04:36,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:36,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-16 17:04:36,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:36,457 INFO L225 Difference]: With dead ends: 72 [2019-09-16 17:04:36,457 INFO L226 Difference]: Without dead ends: 72 [2019-09-16 17:04:36,458 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:36,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-16 17:04:36,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-09-16 17:04:36,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-16 17:04:36,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2019-09-16 17:04:36,473 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2019-09-16 17:04:36,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:36,473 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2019-09-16 17:04:36,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:36,474 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2019-09-16 17:04:36,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 17:04:36,478 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:36,478 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:36,478 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:36,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:36,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2019-09-16 17:04:36,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:36,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:36,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:36,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:36,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:36,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:36,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:36,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:36,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:36,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:36,563 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2019-09-16 17:04:36,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:36,592 INFO L93 Difference]: Finished difference Result 75 states and 128 transitions. [2019-09-16 17:04:36,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:36,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-16 17:04:36,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:36,594 INFO L225 Difference]: With dead ends: 75 [2019-09-16 17:04:36,594 INFO L226 Difference]: Without dead ends: 75 [2019-09-16 17:04:36,595 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:36,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-16 17:04:36,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-09-16 17:04:36,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-16 17:04:36,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2019-09-16 17:04:36,604 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2019-09-16 17:04:36,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:36,605 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2019-09-16 17:04:36,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:36,605 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2019-09-16 17:04:36,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 17:04:36,606 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:36,607 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:36,607 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:36,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:36,607 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2019-09-16 17:04:36,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:36,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:36,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:36,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:36,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:36,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:36,686 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:36,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:36,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:36,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:36,688 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2019-09-16 17:04:36,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:36,718 INFO L93 Difference]: Finished difference Result 134 states and 237 transitions. [2019-09-16 17:04:36,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:36,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-16 17:04:36,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:36,720 INFO L225 Difference]: With dead ends: 134 [2019-09-16 17:04:36,721 INFO L226 Difference]: Without dead ends: 134 [2019-09-16 17:04:36,721 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:36,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-16 17:04:36,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2019-09-16 17:04:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-16 17:04:36,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2019-09-16 17:04:36,731 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2019-09-16 17:04:36,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:36,732 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2019-09-16 17:04:36,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:36,732 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2019-09-16 17:04:36,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 17:04:36,733 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:36,733 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:36,734 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:36,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:36,734 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2019-09-16 17:04:36,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:36,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:36,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:36,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:36,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:36,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:36,778 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:36,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:36,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:36,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:36,779 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2019-09-16 17:04:36,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:36,800 INFO L93 Difference]: Finished difference Result 136 states and 235 transitions. [2019-09-16 17:04:36,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:36,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-16 17:04:36,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:36,802 INFO L225 Difference]: With dead ends: 136 [2019-09-16 17:04:36,802 INFO L226 Difference]: Without dead ends: 136 [2019-09-16 17:04:36,803 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:36,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-16 17:04:36,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2019-09-16 17:04:36,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-16 17:04:36,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2019-09-16 17:04:36,819 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2019-09-16 17:04:36,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:36,821 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2019-09-16 17:04:36,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:36,822 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2019-09-16 17:04:36,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 17:04:36,823 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:36,823 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:36,824 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:36,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:36,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2019-09-16 17:04:36,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:36,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:36,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:36,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:36,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:36,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:36,891 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:36,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:36,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:36,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:36,892 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2019-09-16 17:04:36,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:36,909 INFO L93 Difference]: Finished difference Result 138 states and 235 transitions. [2019-09-16 17:04:36,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:36,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-16 17:04:36,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:36,912 INFO L225 Difference]: With dead ends: 138 [2019-09-16 17:04:36,912 INFO L226 Difference]: Without dead ends: 138 [2019-09-16 17:04:36,912 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:36,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-16 17:04:36,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-09-16 17:04:36,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-16 17:04:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2019-09-16 17:04:36,923 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2019-09-16 17:04:36,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:36,923 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2019-09-16 17:04:36,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:36,923 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2019-09-16 17:04:36,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 17:04:36,925 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:36,925 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:36,925 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:36,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:36,926 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2019-09-16 17:04:36,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:36,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:36,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:36,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:36,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:36,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:36,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:36,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:36,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:36,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:36,968 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2019-09-16 17:04:36,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:36,997 INFO L93 Difference]: Finished difference Result 250 states and 435 transitions. [2019-09-16 17:04:36,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:36,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-16 17:04:36,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,000 INFO L225 Difference]: With dead ends: 250 [2019-09-16 17:04:37,002 INFO L226 Difference]: Without dead ends: 250 [2019-09-16 17:04:37,002 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-16 17:04:37,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2019-09-16 17:04:37,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-16 17:04:37,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2019-09-16 17:04:37,022 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2019-09-16 17:04:37,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,022 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2019-09-16 17:04:37,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,023 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2019-09-16 17:04:37,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 17:04:37,029 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,029 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,029 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,030 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2019-09-16 17:04:37,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,076 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2019-09-16 17:04:37,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,093 INFO L93 Difference]: Finished difference Result 258 states and 435 transitions. [2019-09-16 17:04:37,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-16 17:04:37,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,096 INFO L225 Difference]: With dead ends: 258 [2019-09-16 17:04:37,096 INFO L226 Difference]: Without dead ends: 258 [2019-09-16 17:04:37,097 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-16 17:04:37,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-09-16 17:04:37,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-16 17:04:37,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2019-09-16 17:04:37,110 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2019-09-16 17:04:37,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,110 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2019-09-16 17:04:37,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,111 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2019-09-16 17:04:37,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 17:04:37,112 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,113 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,113 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2019-09-16 17:04:37,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,150 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2019-09-16 17:04:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,171 INFO L93 Difference]: Finished difference Result 262 states and 435 transitions. [2019-09-16 17:04:37,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 17:04:37,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,188 INFO L225 Difference]: With dead ends: 262 [2019-09-16 17:04:37,188 INFO L226 Difference]: Without dead ends: 262 [2019-09-16 17:04:37,189 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-16 17:04:37,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-09-16 17:04:37,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-16 17:04:37,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2019-09-16 17:04:37,197 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2019-09-16 17:04:37,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,198 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2019-09-16 17:04:37,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,198 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2019-09-16 17:04:37,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 17:04:37,199 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,199 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,200 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2019-09-16 17:04:37,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,225 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2019-09-16 17:04:37,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,244 INFO L93 Difference]: Finished difference Result 474 states and 799 transitions. [2019-09-16 17:04:37,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 17:04:37,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,248 INFO L225 Difference]: With dead ends: 474 [2019-09-16 17:04:37,248 INFO L226 Difference]: Without dead ends: 474 [2019-09-16 17:04:37,249 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-09-16 17:04:37,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2019-09-16 17:04:37,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-16 17:04:37,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2019-09-16 17:04:37,260 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2019-09-16 17:04:37,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,260 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2019-09-16 17:04:37,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,261 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2019-09-16 17:04:37,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 17:04:37,262 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,262 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,263 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,263 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2019-09-16 17:04:37,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,284 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,285 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2019-09-16 17:04:37,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,305 INFO L93 Difference]: Finished difference Result 498 states and 807 transitions. [2019-09-16 17:04:37,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 17:04:37,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,308 INFO L225 Difference]: With dead ends: 498 [2019-09-16 17:04:37,309 INFO L226 Difference]: Without dead ends: 498 [2019-09-16 17:04:37,309 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-09-16 17:04:37,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2019-09-16 17:04:37,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-09-16 17:04:37,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2019-09-16 17:04:37,323 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2019-09-16 17:04:37,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,324 INFO L475 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2019-09-16 17:04:37,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,324 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2019-09-16 17:04:37,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 17:04:37,325 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,325 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,326 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,326 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2019-09-16 17:04:37,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,351 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2019-09-16 17:04:37,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,370 INFO L93 Difference]: Finished difference Result 506 states and 807 transitions. [2019-09-16 17:04:37,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 17:04:37,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,373 INFO L225 Difference]: With dead ends: 506 [2019-09-16 17:04:37,374 INFO L226 Difference]: Without dead ends: 506 [2019-09-16 17:04:37,374 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-09-16 17:04:37,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2019-09-16 17:04:37,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-16 17:04:37,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2019-09-16 17:04:37,388 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2019-09-16 17:04:37,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,388 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2019-09-16 17:04:37,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,388 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2019-09-16 17:04:37,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 17:04:37,389 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,390 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,390 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2019-09-16 17:04:37,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,413 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2019-09-16 17:04:37,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,431 INFO L93 Difference]: Finished difference Result 906 states and 1463 transitions. [2019-09-16 17:04:37,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 17:04:37,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,437 INFO L225 Difference]: With dead ends: 906 [2019-09-16 17:04:37,437 INFO L226 Difference]: Without dead ends: 906 [2019-09-16 17:04:37,438 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-09-16 17:04:37,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2019-09-16 17:04:37,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-09-16 17:04:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2019-09-16 17:04:37,457 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2019-09-16 17:04:37,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,458 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2019-09-16 17:04:37,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,458 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2019-09-16 17:04:37,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 17:04:37,460 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,460 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,460 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2019-09-16 17:04:37,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,482 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,483 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2019-09-16 17:04:37,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,505 INFO L93 Difference]: Finished difference Result 970 states and 1495 transitions. [2019-09-16 17:04:37,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 17:04:37,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,510 INFO L225 Difference]: With dead ends: 970 [2019-09-16 17:04:37,511 INFO L226 Difference]: Without dead ends: 970 [2019-09-16 17:04:37,511 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-09-16 17:04:37,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2019-09-16 17:04:37,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-09-16 17:04:37,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2019-09-16 17:04:37,534 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2019-09-16 17:04:37,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,535 INFO L475 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2019-09-16 17:04:37,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,535 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2019-09-16 17:04:37,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 17:04:37,536 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,537 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,537 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2019-09-16 17:04:37,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,559 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2019-09-16 17:04:37,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,578 INFO L93 Difference]: Finished difference Result 986 states and 1495 transitions. [2019-09-16 17:04:37,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 17:04:37,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,583 INFO L225 Difference]: With dead ends: 986 [2019-09-16 17:04:37,584 INFO L226 Difference]: Without dead ends: 986 [2019-09-16 17:04:37,584 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2019-09-16 17:04:37,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2019-09-16 17:04:37,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-09-16 17:04:37,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2019-09-16 17:04:37,607 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2019-09-16 17:04:37,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,608 INFO L475 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2019-09-16 17:04:37,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,608 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2019-09-16 17:04:37,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 17:04:37,610 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,610 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,610 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,610 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2019-09-16 17:04:37,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,636 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2019-09-16 17:04:37,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,656 INFO L93 Difference]: Finished difference Result 1738 states and 2663 transitions. [2019-09-16 17:04:37,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 17:04:37,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,665 INFO L225 Difference]: With dead ends: 1738 [2019-09-16 17:04:37,665 INFO L226 Difference]: Without dead ends: 1738 [2019-09-16 17:04:37,666 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-09-16 17:04:37,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2019-09-16 17:04:37,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2019-09-16 17:04:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2019-09-16 17:04:37,700 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2019-09-16 17:04:37,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,701 INFO L475 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2019-09-16 17:04:37,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2019-09-16 17:04:37,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 17:04:37,703 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,704 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,704 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2019-09-16 17:04:37,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,734 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2019-09-16 17:04:37,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,763 INFO L93 Difference]: Finished difference Result 1898 states and 2759 transitions. [2019-09-16 17:04:37,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 17:04:37,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,773 INFO L225 Difference]: With dead ends: 1898 [2019-09-16 17:04:37,774 INFO L226 Difference]: Without dead ends: 1898 [2019-09-16 17:04:37,774 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2019-09-16 17:04:37,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2019-09-16 17:04:37,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-09-16 17:04:37,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2019-09-16 17:04:37,834 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2019-09-16 17:04:37,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,834 INFO L475 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2019-09-16 17:04:37,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2019-09-16 17:04:37,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 17:04:37,837 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,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] [2019-09-16 17:04:37,838 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,839 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2019-09-16 17:04:37,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,862 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2019-09-16 17:04:37,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,886 INFO L93 Difference]: Finished difference Result 1930 states and 2759 transitions. [2019-09-16 17:04:37,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-16 17:04:37,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,896 INFO L225 Difference]: With dead ends: 1930 [2019-09-16 17:04:37,896 INFO L226 Difference]: Without dead ends: 1930 [2019-09-16 17:04:37,896 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-09-16 17:04:37,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2019-09-16 17:04:37,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-09-16 17:04:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2019-09-16 17:04:37,940 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2019-09-16 17:04:37,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,940 INFO L475 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2019-09-16 17:04:37,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2019-09-16 17:04:37,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 17:04:37,943 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,943 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,944 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2019-09-16 17:04:37,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,964 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2019-09-16 17:04:37,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,995 INFO L93 Difference]: Finished difference Result 3338 states and 4807 transitions. [2019-09-16 17:04:37,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-16 17:04:37,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,013 INFO L225 Difference]: With dead ends: 3338 [2019-09-16 17:04:38,014 INFO L226 Difference]: Without dead ends: 3338 [2019-09-16 17:04:38,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-16 17:04:38,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2019-09-16 17:04:38,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2019-09-16 17:04:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2019-09-16 17:04:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2019-09-16 17:04:38,103 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2019-09-16 17:04:38,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,104 INFO L475 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2019-09-16 17:04:38,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2019-09-16 17:04:38,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 17:04:38,115 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,115 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,115 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2019-09-16 17:04:38,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,150 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,152 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2019-09-16 17:04:38,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,211 INFO L93 Difference]: Finished difference Result 3722 states and 5063 transitions. [2019-09-16 17:04:38,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:38,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-16 17:04:38,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,232 INFO L225 Difference]: With dead ends: 3722 [2019-09-16 17:04:38,232 INFO L226 Difference]: Without dead ends: 3722 [2019-09-16 17:04:38,233 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-09-16 17:04:38,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2019-09-16 17:04:38,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2019-09-16 17:04:38,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2019-09-16 17:04:38,339 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2019-09-16 17:04:38,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,339 INFO L475 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2019-09-16 17:04:38,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2019-09-16 17:04:38,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 17:04:38,347 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,347 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,347 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2019-09-16 17:04:38,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,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-16 17:04:38,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,380 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,381 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2019-09-16 17:04:38,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,427 INFO L93 Difference]: Finished difference Result 3786 states and 5063 transitions. [2019-09-16 17:04:38,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:38,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-16 17:04:38,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,449 INFO L225 Difference]: With dead ends: 3786 [2019-09-16 17:04:38,449 INFO L226 Difference]: Without dead ends: 3786 [2019-09-16 17:04:38,449 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-09-16 17:04:38,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-09-16 17:04:38,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-09-16 17:04:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2019-09-16 17:04:38,570 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2019-09-16 17:04:38,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,570 INFO L475 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2019-09-16 17:04:38,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2019-09-16 17:04:38,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 17:04:38,578 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,578 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,579 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2019-09-16 17:04:38,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,607 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2019-09-16 17:04:38,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,667 INFO L93 Difference]: Finished difference Result 7306 states and 9351 transitions. [2019-09-16 17:04:38,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:38,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-16 17:04:38,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,716 INFO L225 Difference]: With dead ends: 7306 [2019-09-16 17:04:38,716 INFO L226 Difference]: Without dead ends: 7306 [2019-09-16 17:04:38,717 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2019-09-16 17:04:38,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2019-09-16 17:04:38,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2019-09-16 17:04:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2019-09-16 17:04:38,928 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2019-09-16 17:04:38,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,928 INFO L475 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2019-09-16 17:04:38,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2019-09-16 17:04:38,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 17:04:38,938 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,938 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,938 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2019-09-16 17:04:38,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,966 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2019-09-16 17:04:39,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:39,009 INFO L93 Difference]: Finished difference Result 8074 states and 10503 transitions. [2019-09-16 17:04:39,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:39,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-16 17:04:39,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:39,028 INFO L225 Difference]: With dead ends: 8074 [2019-09-16 17:04:39,028 INFO L226 Difference]: Without dead ends: 8074 [2019-09-16 17:04:39,029 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:39,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2019-09-16 17:04:39,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2019-09-16 17:04:39,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2019-09-16 17:04:39,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2019-09-16 17:04:39,196 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2019-09-16 17:04:39,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:39,196 INFO L475 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2019-09-16 17:04:39,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:39,197 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2019-09-16 17:04:39,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 17:04:39,219 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:39,220 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:39,221 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:39,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:39,222 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2019-09-16 17:04:39,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:39,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:39,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:39,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:39,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:39,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:39,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:39,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:39,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:39,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:39,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:39,252 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2019-09-16 17:04:39,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:39,315 INFO L93 Difference]: Finished difference Result 12170 states and 15239 transitions. [2019-09-16 17:04:39,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:39,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-16 17:04:39,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:39,351 INFO L225 Difference]: With dead ends: 12170 [2019-09-16 17:04:39,351 INFO L226 Difference]: Without dead ends: 12170 [2019-09-16 17:04:39,358 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:39,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2019-09-16 17:04:39,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2019-09-16 17:04:39,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2019-09-16 17:04:39,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2019-09-16 17:04:39,674 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2019-09-16 17:04:39,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:39,674 INFO L475 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2019-09-16 17:04:39,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:39,674 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2019-09-16 17:04:39,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 17:04:39,692 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:39,692 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:39,692 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:39,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:39,693 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2019-09-16 17:04:39,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:39,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:39,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:39,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:39,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:39,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:39,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:39,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:39,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:39,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:39,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:39,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:39,718 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2019-09-16 17:04:39,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:39,778 INFO L93 Difference]: Finished difference Result 14218 states and 16903 transitions. [2019-09-16 17:04:39,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:39,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-16 17:04:39,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:39,809 INFO L225 Difference]: With dead ends: 14218 [2019-09-16 17:04:39,809 INFO L226 Difference]: Without dead ends: 14218 [2019-09-16 17:04:39,810 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:39,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2019-09-16 17:04:40,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2019-09-16 17:04:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-09-16 17:04:40,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 16902 transitions. [2019-09-16 17:04:40,099 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 16902 transitions. Word has length 28 [2019-09-16 17:04:40,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:40,099 INFO L475 AbstractCegarLoop]: Abstraction has 14216 states and 16902 transitions. [2019-09-16 17:04:40,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:40,100 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 16902 transitions. [2019-09-16 17:04:40,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 17:04:40,124 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:40,124 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:40,126 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:40,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:40,126 INFO L82 PathProgramCache]: Analyzing trace with hash 690414627, now seen corresponding path program 1 times [2019-09-16 17:04:40,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:40,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:40,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:40,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:40,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:40,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:40,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:40,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:40,154 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:40,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:40,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:40,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:40,156 INFO L87 Difference]: Start difference. First operand 14216 states and 16902 transitions. Second operand 3 states. [2019-09-16 17:04:40,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:40,231 INFO L93 Difference]: Finished difference Result 14602 states and 17159 transitions. [2019-09-16 17:04:40,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:40,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-16 17:04:40,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:40,267 INFO L225 Difference]: With dead ends: 14602 [2019-09-16 17:04:40,267 INFO L226 Difference]: Without dead ends: 14602 [2019-09-16 17:04:40,268 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:40,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2019-09-16 17:04:40,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14600. [2019-09-16 17:04:40,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2019-09-16 17:04:40,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 17158 transitions. [2019-09-16 17:04:40,661 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 17158 transitions. Word has length 29 [2019-09-16 17:04:40,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:40,661 INFO L475 AbstractCegarLoop]: Abstraction has 14600 states and 17158 transitions. [2019-09-16 17:04:40,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:40,662 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 17158 transitions. [2019-09-16 17:04:40,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 17:04:40,682 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:40,682 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:40,683 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:40,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:40,683 INFO L82 PathProgramCache]: Analyzing trace with hash -320702623, now seen corresponding path program 1 times [2019-09-16 17:04:40,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:40,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:40,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:40,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:40,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:40,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:40,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:40,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:40,704 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:40,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:40,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:40,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:40,705 INFO L87 Difference]: Start difference. First operand 14600 states and 17158 transitions. Second operand 3 states. [2019-09-16 17:04:40,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:40,785 INFO L93 Difference]: Finished difference Result 23560 states and 26886 transitions. [2019-09-16 17:04:40,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:40,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-16 17:04:40,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:40,830 INFO L225 Difference]: With dead ends: 23560 [2019-09-16 17:04:40,831 INFO L226 Difference]: Without dead ends: 23560 [2019-09-16 17:04:40,831 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:40,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2019-09-16 17:04:41,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 22536. [2019-09-16 17:04:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22536 states. [2019-09-16 17:04:41,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22536 states to 22536 states and 25862 transitions. [2019-09-16 17:04:41,241 INFO L78 Accepts]: Start accepts. Automaton has 22536 states and 25862 transitions. Word has length 29 [2019-09-16 17:04:41,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:41,241 INFO L475 AbstractCegarLoop]: Abstraction has 22536 states and 25862 transitions. [2019-09-16 17:04:41,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:41,242 INFO L276 IsEmpty]: Start isEmpty. Operand 22536 states and 25862 transitions. [2019-09-16 17:04:41,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 17:04:41,288 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:41,288 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:41,288 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:41,289 INFO L82 PathProgramCache]: Analyzing trace with hash -907508637, now seen corresponding path program 1 times [2019-09-16 17:04:41,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:41,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:41,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:41,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:41,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:41,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:41,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:41,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:41,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:41,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:41,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:41,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:41,311 INFO L87 Difference]: Start difference. First operand 22536 states and 25862 transitions. Second operand 3 states. [2019-09-16 17:04:41,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:41,919 INFO L93 Difference]: Finished difference Result 28166 states and 30725 transitions. [2019-09-16 17:04:41,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:41,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-16 17:04:41,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:41,920 INFO L225 Difference]: With dead ends: 28166 [2019-09-16 17:04:41,920 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:04:41,921 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:41,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:04:41,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:04:41,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:04:41,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:04:41,922 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-09-16 17:04:41,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:41,922 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:04:41,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:41,922 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:04:41,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:04:41,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:04:41 BoogieIcfgContainer [2019-09-16 17:04:41,928 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:04:41,930 INFO L168 Benchmark]: Toolchain (without parser) took 6923.41 ms. Allocated memory was 129.5 MB in the beginning and 549.5 MB in the end (delta: 420.0 MB). Free memory was 84.9 MB in the beginning and 478.0 MB in the end (delta: -393.1 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:41,931 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 129.5 MB. Free memory was 103.5 MB in the beginning and 103.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:04:41,931 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.58 ms. Allocated memory was 129.5 MB in the beginning and 197.7 MB in the end (delta: 68.2 MB). Free memory was 84.5 MB in the beginning and 174.9 MB in the end (delta: -90.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:41,932 INFO L168 Benchmark]: Boogie Preprocessor took 45.87 ms. Allocated memory is still 197.7 MB. Free memory was 174.9 MB in the beginning and 172.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:41,933 INFO L168 Benchmark]: RCFGBuilder took 413.59 ms. Allocated memory is still 197.7 MB. Free memory was 172.4 MB in the beginning and 153.3 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:41,934 INFO L168 Benchmark]: TraceAbstraction took 6108.94 ms. Allocated memory was 197.7 MB in the beginning and 549.5 MB in the end (delta: 351.8 MB). Free memory was 152.6 MB in the beginning and 478.0 MB in the end (delta: -325.3 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:41,937 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.18 ms. Allocated memory is still 129.5 MB. Free memory was 103.5 MB in the beginning and 103.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 350.58 ms. Allocated memory was 129.5 MB in the beginning and 197.7 MB in the end (delta: 68.2 MB). Free memory was 84.5 MB in the beginning and 174.9 MB in the end (delta: -90.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.87 ms. Allocated memory is still 197.7 MB. Free memory was 174.9 MB in the beginning and 172.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 413.59 ms. Allocated memory is still 197.7 MB. Free memory was 172.4 MB in the beginning and 153.3 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6108.94 ms. Allocated memory was 197.7 MB in the beginning and 549.5 MB in the end (delta: 351.8 MB). Free memory was 152.6 MB in the beginning and 478.0 MB in the end (delta: -325.3 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 1 error locations. SAFE Result, 6.0s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2384 SDtfs, 1153 SDslu, 1624 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22536occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 31265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...