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_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:26:52,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:26:52,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:26:52,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:26:52,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:26:52,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:26:52,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:26:52,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:26:52,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:26:52,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:26:52,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:26:52,828 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:26:52,828 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:26:52,829 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:26:52,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:26:52,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:26:52,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:26:52,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:26:52,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:26:52,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:26:52,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:26:52,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:26:52,843 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:26:52,847 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:26:52,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:26:52,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:26:52,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:26:52,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:26:52,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:26:52,857 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:26:52,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:26:52,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:26:52,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:26:52,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:26:52,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:26:52,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:26:52,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:26:52,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:26:52,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:26:52,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:26:52,869 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:26:52,870 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-20 13:26:52,899 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:26:52,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:26:52,901 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:26:52,901 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:26:52,901 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:26:52,902 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:26:52,902 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:26:52,902 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:26:52,902 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:26:52,903 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:26:52,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:26:52,905 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:26:52,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:26:52,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:26:52,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:26:52,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:26:52,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:26:52,907 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:26:52,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:26:52,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:26:52,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:26:52,908 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:26:52,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:26:52,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:52,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:26:52,909 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:26:52,909 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:26:52,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:26:52,910 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:26:52,910 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:26:52,968 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:26:52,987 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:26:52,990 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:26:52,992 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:26:52,992 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:26:52,993 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2019-09-20 13:26:53,069 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/008d75f80/c0464c83a0e9483cbb0af253b74160e9/FLAG9c2769463 [2019-09-20 13:26:53,487 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:26:53,487 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2019-09-20 13:26:53,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/008d75f80/c0464c83a0e9483cbb0af253b74160e9/FLAG9c2769463 [2019-09-20 13:26:53,870 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/008d75f80/c0464c83a0e9483cbb0af253b74160e9 [2019-09-20 13:26:53,880 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:26:53,882 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:26:53,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:53,883 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:26:53,886 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:26:53,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:53" (1/1) ... [2019-09-20 13:26:53,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@611a2955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:53, skipping insertion in model container [2019-09-20 13:26:53,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:53" (1/1) ... [2019-09-20 13:26:53,898 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:26:53,918 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:26:54,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:54,126 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:26:54,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:54,163 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:26:54,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:54 WrapperNode [2019-09-20 13:26:54,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:54,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:26:54,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:26:54,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:26:54,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:54" (1/1) ... [2019-09-20 13:26:54,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:54" (1/1) ... [2019-09-20 13:26:54,263 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:54" (1/1) ... [2019-09-20 13:26:54,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:54" (1/1) ... [2019-09-20 13:26:54,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:54" (1/1) ... [2019-09-20 13:26:54,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:54" (1/1) ... [2019-09-20 13:26:54,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:54" (1/1) ... [2019-09-20 13:26:54,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:26:54,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:26:54,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:26:54,283 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:26:54,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:54,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:26:54,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:26:54,337 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:26:54,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:26:54,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:26:54,338 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:26:54,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:26:54,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:26:54,581 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:26:54,582 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:26:54,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:54 BoogieIcfgContainer [2019-09-20 13:26:54,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:26:54,585 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:26:54,585 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:26:54,588 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:26:54,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:26:53" (1/3) ... [2019-09-20 13:26:54,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ebcebc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:54, skipping insertion in model container [2019-09-20 13:26:54,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:54" (2/3) ... [2019-09-20 13:26:54,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ebcebc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:54, skipping insertion in model container [2019-09-20 13:26:54,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:54" (3/3) ... [2019-09-20 13:26:54,593 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2019-09-20 13:26:54,611 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:26:54,623 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:26:54,647 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:26:54,699 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:26:54,700 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:26:54,700 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:26:54,700 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:26:54,700 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:26:54,700 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:26:54,701 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:26:54,701 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:26:54,718 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-09-20 13:26:54,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 13:26:54,727 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:54,728 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:54,731 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:54,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:54,737 INFO L82 PathProgramCache]: Analyzing trace with hash 429652513, now seen corresponding path program 1 times [2019-09-20 13:26:54,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:54,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:54,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:54,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:54,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:54,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:54,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:54,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:54,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:54,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:54,956 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2019-09-20 13:26:54,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:54,999 INFO L93 Difference]: Finished difference Result 56 states and 89 transitions. [2019-09-20 13:26:55,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:55,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-20 13:26:55,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:55,012 INFO L225 Difference]: With dead ends: 56 [2019-09-20 13:26:55,012 INFO L226 Difference]: Without dead ends: 48 [2019-09-20 13:26:55,015 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-20 13:26:55,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-09-20 13:26:55,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-20 13:26:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2019-09-20 13:26:55,054 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 16 [2019-09-20 13:26:55,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,055 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2019-09-20 13:26:55,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:55,055 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2019-09-20 13:26:55,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 13:26:55,056 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,056 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:55,057 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1109710883, now seen corresponding path program 1 times [2019-09-20 13:26:55,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:55,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:55,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:55,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:55,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:55,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:55,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:55,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,107 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2019-09-20 13:26:55,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:55,144 INFO L93 Difference]: Finished difference Result 48 states and 78 transitions. [2019-09-20 13:26:55,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:55,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-20 13:26:55,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:55,146 INFO L225 Difference]: With dead ends: 48 [2019-09-20 13:26:55,146 INFO L226 Difference]: Without dead ends: 48 [2019-09-20 13:26:55,147 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-20 13:26:55,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-09-20 13:26:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-20 13:26:55,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2019-09-20 13:26:55,155 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 16 [2019-09-20 13:26:55,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,156 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2019-09-20 13:26:55,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:55,156 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2019-09-20 13:26:55,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:26:55,157 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,158 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:55,158 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,158 INFO L82 PathProgramCache]: Analyzing trace with hash 434540691, now seen corresponding path program 1 times [2019-09-20 13:26:55,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:55,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:55,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:55,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:55,206 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:55,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:55,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:55,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,207 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2019-09-20 13:26:55,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:55,226 INFO L93 Difference]: Finished difference Result 51 states and 80 transitions. [2019-09-20 13:26:55,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:55,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-20 13:26:55,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:55,228 INFO L225 Difference]: With dead ends: 51 [2019-09-20 13:26:55,229 INFO L226 Difference]: Without dead ends: 51 [2019-09-20 13:26:55,229 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-20 13:26:55,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-09-20 13:26:55,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-20 13:26:55,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2019-09-20 13:26:55,237 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 17 [2019-09-20 13:26:55,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,238 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2019-09-20 13:26:55,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:55,238 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2019-09-20 13:26:55,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:26:55,241 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,242 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:55,242 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,242 INFO L82 PathProgramCache]: Analyzing trace with hash 41513681, now seen corresponding path program 1 times [2019-09-20 13:26:55,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:55,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:55,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:55,289 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:55,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:55,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:55,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,291 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 3 states. [2019-09-20 13:26:55,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:55,310 INFO L93 Difference]: Finished difference Result 86 states and 141 transitions. [2019-09-20 13:26:55,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:55,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-20 13:26:55,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:55,312 INFO L225 Difference]: With dead ends: 86 [2019-09-20 13:26:55,313 INFO L226 Difference]: Without dead ends: 86 [2019-09-20 13:26:55,313 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-20 13:26:55,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2019-09-20 13:26:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-20 13:26:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2019-09-20 13:26:55,323 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 17 [2019-09-20 13:26:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,324 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2019-09-20 13:26:55,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2019-09-20 13:26:55,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:26:55,325 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,325 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:55,326 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,326 INFO L82 PathProgramCache]: Analyzing trace with hash 721572051, now seen corresponding path program 1 times [2019-09-20 13:26:55,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:55,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:55,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:55,370 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:55,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:55,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:55,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,371 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 3 states. [2019-09-20 13:26:55,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:55,397 INFO L93 Difference]: Finished difference Result 88 states and 139 transitions. [2019-09-20 13:26:55,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:55,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-20 13:26:55,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:55,399 INFO L225 Difference]: With dead ends: 88 [2019-09-20 13:26:55,399 INFO L226 Difference]: Without dead ends: 88 [2019-09-20 13:26:55,400 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-20 13:26:55,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-09-20 13:26:55,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-20 13:26:55,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2019-09-20 13:26:55,410 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 17 [2019-09-20 13:26:55,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,410 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2019-09-20 13:26:55,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:55,410 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2019-09-20 13:26:55,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:26:55,412 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,412 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:55,412 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1287139128, now seen corresponding path program 1 times [2019-09-20 13:26:55,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:55,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:55,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:55,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:55,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:55,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:55,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,450 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand 3 states. [2019-09-20 13:26:55,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:55,466 INFO L93 Difference]: Finished difference Result 90 states and 139 transitions. [2019-09-20 13:26:55,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:55,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-20 13:26:55,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:55,469 INFO L225 Difference]: With dead ends: 90 [2019-09-20 13:26:55,469 INFO L226 Difference]: Without dead ends: 90 [2019-09-20 13:26:55,469 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-20 13:26:55,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-09-20 13:26:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-20 13:26:55,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2019-09-20 13:26:55,479 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 18 [2019-09-20 13:26:55,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,480 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2019-09-20 13:26:55,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:55,480 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2019-09-20 13:26:55,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:26:55,481 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,481 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:55,482 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,482 INFO L82 PathProgramCache]: Analyzing trace with hash 894112118, now seen corresponding path program 1 times [2019-09-20 13:26:55,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:55,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:55,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:55,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:55,525 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:55,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:55,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:55,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,527 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand 3 states. [2019-09-20 13:26:55,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:55,568 INFO L93 Difference]: Finished difference Result 154 states and 243 transitions. [2019-09-20 13:26:55,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:55,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-20 13:26:55,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:55,571 INFO L225 Difference]: With dead ends: 154 [2019-09-20 13:26:55,572 INFO L226 Difference]: Without dead ends: 154 [2019-09-20 13:26:55,572 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-20 13:26:55,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2019-09-20 13:26:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-20 13:26:55,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2019-09-20 13:26:55,596 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 18 [2019-09-20 13:26:55,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,597 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2019-09-20 13:26:55,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:55,600 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2019-09-20 13:26:55,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:26:55,602 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,602 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:55,604 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170488, now seen corresponding path program 1 times [2019-09-20 13:26:55,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:55,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:55,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:55,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:55,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:55,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:55,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:55,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,655 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand 3 states. [2019-09-20 13:26:55,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:55,681 INFO L93 Difference]: Finished difference Result 162 states and 243 transitions. [2019-09-20 13:26:55,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:55,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-20 13:26:55,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:55,683 INFO L225 Difference]: With dead ends: 162 [2019-09-20 13:26:55,684 INFO L226 Difference]: Without dead ends: 162 [2019-09-20 13:26:55,684 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-20 13:26:55,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-09-20 13:26:55,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-20 13:26:55,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2019-09-20 13:26:55,697 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 18 [2019-09-20 13:26:55,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,698 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2019-09-20 13:26:55,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:55,698 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2019-09-20 13:26:55,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:26:55,699 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,700 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:55,700 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1947887240, now seen corresponding path program 1 times [2019-09-20 13:26:55,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:55,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:55,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:55,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:55,734 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:55,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:55,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:55,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,736 INFO L87 Difference]: Start difference. First operand 160 states and 242 transitions. Second operand 3 states. [2019-09-20 13:26:55,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:55,755 INFO L93 Difference]: Finished difference Result 166 states and 243 transitions. [2019-09-20 13:26:55,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:55,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:26:55,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:55,757 INFO L225 Difference]: With dead ends: 166 [2019-09-20 13:26:55,758 INFO L226 Difference]: Without dead ends: 166 [2019-09-20 13:26:55,758 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-20 13:26:55,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-09-20 13:26:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-20 13:26:55,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2019-09-20 13:26:55,769 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 19 [2019-09-20 13:26:55,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,769 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2019-09-20 13:26:55,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:55,770 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2019-09-20 13:26:55,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:26:55,771 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,772 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:55,772 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1554860230, now seen corresponding path program 1 times [2019-09-20 13:26:55,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:55,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:55,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:55,805 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:55,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:55,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:55,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,807 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand 3 states. [2019-09-20 13:26:55,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:55,824 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2019-09-20 13:26:55,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:55,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:26:55,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:55,826 INFO L225 Difference]: With dead ends: 282 [2019-09-20 13:26:55,826 INFO L226 Difference]: Without dead ends: 282 [2019-09-20 13:26:55,827 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-20 13:26:55,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2019-09-20 13:26:55,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-20 13:26:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2019-09-20 13:26:55,840 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 19 [2019-09-20 13:26:55,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,840 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2019-09-20 13:26:55,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2019-09-20 13:26:55,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:26:55,842 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,843 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:55,843 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,843 INFO L82 PathProgramCache]: Analyzing trace with hash -2060048696, now seen corresponding path program 1 times [2019-09-20 13:26:55,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:55,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:55,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:55,896 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:55,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:55,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:55,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,897 INFO L87 Difference]: Start difference. First operand 232 states and 334 transitions. Second operand 3 states. [2019-09-20 13:26:55,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:55,915 INFO L93 Difference]: Finished difference Result 306 states and 423 transitions. [2019-09-20 13:26:55,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:55,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:26:55,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:55,917 INFO L225 Difference]: With dead ends: 306 [2019-09-20 13:26:55,918 INFO L226 Difference]: Without dead ends: 306 [2019-09-20 13:26:55,918 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-20 13:26:55,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-09-20 13:26:55,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-20 13:26:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2019-09-20 13:26:55,928 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 19 [2019-09-20 13:26:55,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,928 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2019-09-20 13:26:55,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:55,929 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2019-09-20 13:26:55,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:26:55,930 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,930 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-20 13:26:55,931 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,931 INFO L82 PathProgramCache]: Analyzing trace with hash 956242573, now seen corresponding path program 1 times [2019-09-20 13:26:55,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:55,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:55,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:55,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:55,960 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:55,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:55,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:55,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,961 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 3 states. [2019-09-20 13:26:55,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:55,976 INFO L93 Difference]: Finished difference Result 314 states and 423 transitions. [2019-09-20 13:26:55,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:55,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:26:55,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:55,980 INFO L225 Difference]: With dead ends: 314 [2019-09-20 13:26:55,981 INFO L226 Difference]: Without dead ends: 314 [2019-09-20 13:26:55,981 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-20 13:26:55,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2019-09-20 13:26:55,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-09-20 13:26:55,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 422 transitions. [2019-09-20 13:26:55,989 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 422 transitions. Word has length 20 [2019-09-20 13:26:55,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,989 INFO L475 AbstractCegarLoop]: Abstraction has 312 states and 422 transitions. [2019-09-20 13:26:55,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:55,990 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 422 transitions. [2019-09-20 13:26:55,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:26:55,991 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,991 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-20 13:26:55,991 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,992 INFO L82 PathProgramCache]: Analyzing trace with hash 563215563, now seen corresponding path program 1 times [2019-09-20 13:26:55,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:56,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:56,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:56,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:56,021 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:56,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:56,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:56,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:56,023 INFO L87 Difference]: Start difference. First operand 312 states and 422 transitions. Second operand 3 states. [2019-09-20 13:26:56,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:56,039 INFO L93 Difference]: Finished difference Result 522 states and 695 transitions. [2019-09-20 13:26:56,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:56,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:26:56,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:56,042 INFO L225 Difference]: With dead ends: 522 [2019-09-20 13:26:56,042 INFO L226 Difference]: Without dead ends: 522 [2019-09-20 13:26:56,043 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:56,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-09-20 13:26:56,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2019-09-20 13:26:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-20 13:26:56,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2019-09-20 13:26:56,055 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 20 [2019-09-20 13:26:56,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:56,055 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2019-09-20 13:26:56,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:56,055 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2019-09-20 13:26:56,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:26:56,057 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:56,057 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-20 13:26:56,057 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:56,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:56,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1243273933, now seen corresponding path program 1 times [2019-09-20 13:26:56,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:56,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:56,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:56,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:56,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:56,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:56,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:56,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:56,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:56,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:56,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:56,118 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 3 states. [2019-09-20 13:26:56,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:56,143 INFO L93 Difference]: Finished difference Result 586 states and 727 transitions. [2019-09-20 13:26:56,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:56,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:26:56,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:56,147 INFO L225 Difference]: With dead ends: 586 [2019-09-20 13:26:56,147 INFO L226 Difference]: Without dead ends: 586 [2019-09-20 13:26:56,147 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:56,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-09-20 13:26:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-09-20 13:26:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-20 13:26:56,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 726 transitions. [2019-09-20 13:26:56,161 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 726 transitions. Word has length 20 [2019-09-20 13:26:56,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:56,161 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 726 transitions. [2019-09-20 13:26:56,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:56,161 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 726 transitions. [2019-09-20 13:26:56,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:26:56,163 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:56,163 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:56,163 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:56,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:56,164 INFO L82 PathProgramCache]: Analyzing trace with hash 280029309, now seen corresponding path program 1 times [2019-09-20 13:26:56,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:56,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:56,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:56,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:56,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:56,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:56,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:56,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:56,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:56,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:56,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:56,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:56,191 INFO L87 Difference]: Start difference. First operand 584 states and 726 transitions. Second operand 3 states. [2019-09-20 13:26:56,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:56,213 INFO L93 Difference]: Finished difference Result 602 states and 727 transitions. [2019-09-20 13:26:56,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:56,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:26:56,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:56,217 INFO L225 Difference]: With dead ends: 602 [2019-09-20 13:26:56,217 INFO L226 Difference]: Without dead ends: 602 [2019-09-20 13:26:56,218 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:56,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-20 13:26:56,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-09-20 13:26:56,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-09-20 13:26:56,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 726 transitions. [2019-09-20 13:26:56,234 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 726 transitions. Word has length 21 [2019-09-20 13:26:56,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:56,235 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 726 transitions. [2019-09-20 13:26:56,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:56,235 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 726 transitions. [2019-09-20 13:26:56,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:26:56,236 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:56,236 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:56,237 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:56,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:56,237 INFO L82 PathProgramCache]: Analyzing trace with hash -112997701, now seen corresponding path program 1 times [2019-09-20 13:26:56,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:56,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:56,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:56,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:56,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:56,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:56,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:56,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:56,263 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:56,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:56,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:56,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:56,264 INFO L87 Difference]: Start difference. First operand 600 states and 726 transitions. Second operand 3 states. [2019-09-20 13:26:56,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:56,287 INFO L93 Difference]: Finished difference Result 968 states and 1126 transitions. [2019-09-20 13:26:56,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:56,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:26:56,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:56,293 INFO L225 Difference]: With dead ends: 968 [2019-09-20 13:26:56,293 INFO L226 Difference]: Without dead ends: 968 [2019-09-20 13:26:56,293 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:56,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-09-20 13:26:56,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 904. [2019-09-20 13:26:56,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-09-20 13:26:56,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1062 transitions. [2019-09-20 13:26:56,315 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1062 transitions. Word has length 21 [2019-09-20 13:26:56,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:56,315 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1062 transitions. [2019-09-20 13:26:56,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:56,315 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1062 transitions. [2019-09-20 13:26:56,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:26:56,317 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:56,317 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:56,318 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:56,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:56,318 INFO L82 PathProgramCache]: Analyzing trace with hash 567060669, now seen corresponding path program 1 times [2019-09-20 13:26:56,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:56,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:56,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:56,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:56,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:56,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:56,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:56,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:56,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:56,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:56,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:56,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:56,344 INFO L87 Difference]: Start difference. First operand 904 states and 1062 transitions. Second operand 3 states. [2019-09-20 13:26:56,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:56,365 INFO L93 Difference]: Finished difference Result 1126 states and 1221 transitions. [2019-09-20 13:26:56,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:56,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:26:56,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:56,366 INFO L225 Difference]: With dead ends: 1126 [2019-09-20 13:26:56,366 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:26:56,366 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:56,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:26:56,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:26:56,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:26:56,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:26:56,370 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-09-20 13:26:56,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:56,371 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:26:56,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:56,371 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:26:56,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:26:56,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:26:56 BoogieIcfgContainer [2019-09-20 13:26:56,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:26:56,382 INFO L168 Benchmark]: Toolchain (without parser) took 2498.28 ms. Allocated memory was 131.1 MB in the beginning and 218.6 MB in the end (delta: 87.6 MB). Free memory was 86.9 MB in the beginning and 118.7 MB in the end (delta: -31.8 MB). Peak memory consumption was 55.7 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:56,384 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 131.1 MB. Free memory was 105.3 MB in the beginning and 105.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:26:56,391 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.97 ms. Allocated memory is still 131.1 MB. Free memory was 86.6 MB in the beginning and 76.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:56,392 INFO L168 Benchmark]: Boogie Preprocessor took 118.14 ms. Allocated memory was 131.1 MB in the beginning and 198.2 MB in the end (delta: 67.1 MB). Free memory was 76.7 MB in the beginning and 174.0 MB in the end (delta: -97.4 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:56,392 INFO L168 Benchmark]: RCFGBuilder took 301.47 ms. Allocated memory is still 198.2 MB. Free memory was 174.0 MB in the beginning and 158.3 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:56,394 INFO L168 Benchmark]: TraceAbstraction took 1792.97 ms. Allocated memory was 198.2 MB in the beginning and 218.6 MB in the end (delta: 20.4 MB). Free memory was 158.3 MB in the beginning and 118.7 MB in the end (delta: 39.6 MB). Peak memory consumption was 60.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:56,404 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 131.1 MB. Free memory was 105.3 MB in the beginning and 105.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 280.97 ms. Allocated memory is still 131.1 MB. Free memory was 86.6 MB in the beginning and 76.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 118.14 ms. Allocated memory was 131.1 MB in the beginning and 198.2 MB in the end (delta: 67.1 MB). Free memory was 76.7 MB in the beginning and 174.0 MB in the end (delta: -97.4 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 301.47 ms. Allocated memory is still 198.2 MB. Free memory was 174.0 MB in the beginning and 158.3 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1792.97 ms. Allocated memory was 198.2 MB in the beginning and 218.6 MB in the end (delta: 20.4 MB). Free memory was 158.3 MB in the beginning and 118.7 MB in the end (delta: 39.6 MB). Peak memory consumption was 60.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. SAFE Result, 1.7s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 923 SDtfs, 417 SDslu, 612 SDs, 0 SdLazy, 91 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 9690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...