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-673a906-m [2019-10-03 02:30:59,088 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:30:59,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:30:59,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:30:59,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:30:59,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:30:59,112 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:30:59,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:30:59,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:30:59,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:30:59,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:30:59,119 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:30:59,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:30:59,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:30:59,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:30:59,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:30:59,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:30:59,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:30:59,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:30:59,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:30:59,131 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:30:59,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:30:59,137 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:30:59,137 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:30:59,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:30:59,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:30:59,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:30:59,145 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:30:59,145 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:30:59,146 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:30:59,146 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:30:59,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:30:59,149 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:30:59,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:30:59,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:30:59,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:30:59,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:30:59,155 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:30:59,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:30:59,156 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:30:59,157 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:30:59,159 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-10-03 02:30:59,186 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:30:59,186 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:30:59,187 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:30:59,187 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:30:59,188 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:30:59,188 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:30:59,189 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:30:59,189 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:30:59,189 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:30:59,189 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:30:59,191 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:30:59,192 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:30:59,192 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:30:59,192 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:30:59,193 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:30:59,193 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:30:59,193 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:30:59,193 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:30:59,193 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:30:59,194 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:30:59,194 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:30:59,194 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:30:59,195 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:30:59,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:30:59,195 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:30:59,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:30:59,196 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:30:59,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:30:59,196 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:30:59,196 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:30:59,249 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:30:59,270 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:30:59,275 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:30:59,276 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:30:59,277 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:30:59,278 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-10-03 02:30:59,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ba2864a4/55f9e72c422c4fccb84f3866fff2353b/FLAG0b7862d74 [2019-10-03 02:30:59,788 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:30:59,788 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2019-10-03 02:30:59,803 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ba2864a4/55f9e72c422c4fccb84f3866fff2353b/FLAG0b7862d74 [2019-10-03 02:31:00,177 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ba2864a4/55f9e72c422c4fccb84f3866fff2353b [2019-10-03 02:31:00,186 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:31:00,187 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:31:00,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:31:00,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:31:00,192 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:31:00,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:31:00" (1/1) ... [2019-10-03 02:31:00,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e5a7a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:00, skipping insertion in model container [2019-10-03 02:31:00,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:31:00" (1/1) ... [2019-10-03 02:31:00,204 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:31:00,226 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:31:00,477 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:31:00,482 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:31:00,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:31:00,690 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:31:00,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:00 WrapperNode [2019-10-03 02:31:00,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:31:00,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:31:00,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:31:00,693 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:31:00,704 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:00" (1/1) ... [2019-10-03 02:31:00,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:00" (1/1) ... [2019-10-03 02:31:00,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:00" (1/1) ... [2019-10-03 02:31:00,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:00" (1/1) ... [2019-10-03 02:31:00,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:00" (1/1) ... [2019-10-03 02:31:00,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:00" (1/1) ... [2019-10-03 02:31:00,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:00" (1/1) ... [2019-10-03 02:31:00,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:31:00,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:31:00,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:31:00,727 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:31:00,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:00" (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-10-03 02:31:00,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:31:00,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:31:00,798 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:31:00,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:31:00,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:31:00,799 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:31:00,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:31:00,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:31:01,035 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:31:01,036 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-03 02:31:01,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:31:01 BoogieIcfgContainer [2019-10-03 02:31:01,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:31:01,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:31:01,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:31:01,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:31:01,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:31:00" (1/3) ... [2019-10-03 02:31:01,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f040938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:31:01, skipping insertion in model container [2019-10-03 02:31:01,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:00" (2/3) ... [2019-10-03 02:31:01,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f040938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:31:01, skipping insertion in model container [2019-10-03 02:31:01,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:31:01" (3/3) ... [2019-10-03 02:31:01,046 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2019-10-03 02:31:01,064 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:31:01,077 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:31:01,123 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:31:01,183 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:31:01,184 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:31:01,184 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:31:01,184 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:31:01,184 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:31:01,185 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:31:01,185 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:31:01,185 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:31:01,201 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-10-03 02:31:01,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-03 02:31:01,210 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:01,211 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:01,214 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:01,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:01,219 INFO L82 PathProgramCache]: Analyzing trace with hash 429652513, now seen corresponding path program 1 times [2019-10-03 02:31:01,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:01,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:01,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:01,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:01,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:01,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:01,416 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:01,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:01,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:01,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:01,437 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2019-10-03 02:31:01,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:01,487 INFO L93 Difference]: Finished difference Result 56 states and 89 transitions. [2019-10-03 02:31:01,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:01,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-03 02:31:01,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:01,499 INFO L225 Difference]: With dead ends: 56 [2019-10-03 02:31:01,500 INFO L226 Difference]: Without dead ends: 48 [2019-10-03 02:31:01,501 INFO L640 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-10-03 02:31:01,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-03 02:31:01,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-10-03 02:31:01,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-03 02:31:01,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2019-10-03 02:31:01,540 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 16 [2019-10-03 02:31:01,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:01,540 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2019-10-03 02:31:01,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:01,540 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2019-10-03 02:31:01,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-03 02:31:01,541 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:01,542 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:01,542 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:01,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:01,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1109710883, now seen corresponding path program 1 times [2019-10-03 02:31:01,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:01,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:01,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:01,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:01,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:01,634 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:01,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:01,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:01,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:01,637 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2019-10-03 02:31:01,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:01,662 INFO L93 Difference]: Finished difference Result 48 states and 78 transitions. [2019-10-03 02:31:01,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:01,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-03 02:31:01,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:01,664 INFO L225 Difference]: With dead ends: 48 [2019-10-03 02:31:01,664 INFO L226 Difference]: Without dead ends: 48 [2019-10-03 02:31:01,665 INFO L640 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-10-03 02:31:01,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-03 02:31:01,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-10-03 02:31:01,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-03 02:31:01,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2019-10-03 02:31:01,676 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 16 [2019-10-03 02:31:01,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:01,677 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2019-10-03 02:31:01,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2019-10-03 02:31:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-03 02:31:01,678 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:01,678 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:01,679 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:01,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:01,680 INFO L82 PathProgramCache]: Analyzing trace with hash 434540691, now seen corresponding path program 1 times [2019-10-03 02:31:01,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:01,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:01,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:01,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:01,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:01,738 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:01,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:01,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:01,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:01,739 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2019-10-03 02:31:01,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:01,757 INFO L93 Difference]: Finished difference Result 51 states and 80 transitions. [2019-10-03 02:31:01,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:01,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-03 02:31:01,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:01,758 INFO L225 Difference]: With dead ends: 51 [2019-10-03 02:31:01,759 INFO L226 Difference]: Without dead ends: 51 [2019-10-03 02:31:01,759 INFO L640 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-10-03 02:31:01,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-03 02:31:01,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-10-03 02:31:01,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-03 02:31:01,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2019-10-03 02:31:01,767 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 17 [2019-10-03 02:31:01,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:01,768 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2019-10-03 02:31:01,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2019-10-03 02:31:01,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-03 02:31:01,769 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:01,769 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:01,770 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:01,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:01,770 INFO L82 PathProgramCache]: Analyzing trace with hash 41513681, now seen corresponding path program 1 times [2019-10-03 02:31:01,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:01,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:01,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:01,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:01,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:01,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:01,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:01,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:01,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:01,807 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 3 states. [2019-10-03 02:31:01,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:01,829 INFO L93 Difference]: Finished difference Result 86 states and 141 transitions. [2019-10-03 02:31:01,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:01,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-03 02:31:01,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:01,832 INFO L225 Difference]: With dead ends: 86 [2019-10-03 02:31:01,832 INFO L226 Difference]: Without dead ends: 86 [2019-10-03 02:31:01,832 INFO L640 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-10-03 02:31:01,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-03 02:31:01,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2019-10-03 02:31:01,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-03 02:31:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2019-10-03 02:31:01,841 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 17 [2019-10-03 02:31:01,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:01,842 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2019-10-03 02:31:01,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:01,842 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2019-10-03 02:31:01,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-03 02:31:01,843 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:01,843 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:01,844 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:01,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:01,844 INFO L82 PathProgramCache]: Analyzing trace with hash 721572051, now seen corresponding path program 1 times [2019-10-03 02:31:01,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:01,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:01,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:01,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:01,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:01,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:01,882 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:01,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:01,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:01,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:01,884 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 3 states. [2019-10-03 02:31:01,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:01,900 INFO L93 Difference]: Finished difference Result 88 states and 139 transitions. [2019-10-03 02:31:01,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:01,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-03 02:31:01,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:01,902 INFO L225 Difference]: With dead ends: 88 [2019-10-03 02:31:01,902 INFO L226 Difference]: Without dead ends: 88 [2019-10-03 02:31:01,902 INFO L640 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-10-03 02:31:01,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-03 02:31:01,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-10-03 02:31:01,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-03 02:31:01,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2019-10-03 02:31:01,910 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 17 [2019-10-03 02:31:01,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:01,911 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2019-10-03 02:31:01,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:01,911 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2019-10-03 02:31:01,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-03 02:31:01,912 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:01,912 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:01,913 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:01,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:01,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1287139128, now seen corresponding path program 1 times [2019-10-03 02:31:01,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:01,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:01,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:01,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:01,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:01,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:01,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:01,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:01,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:01,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:01,951 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand 3 states. [2019-10-03 02:31:01,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:01,970 INFO L93 Difference]: Finished difference Result 90 states and 139 transitions. [2019-10-03 02:31:01,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:01,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-03 02:31:01,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:01,972 INFO L225 Difference]: With dead ends: 90 [2019-10-03 02:31:01,972 INFO L226 Difference]: Without dead ends: 90 [2019-10-03 02:31:01,973 INFO L640 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-10-03 02:31:01,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-03 02:31:01,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-10-03 02:31:01,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-03 02:31:01,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2019-10-03 02:31:01,980 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 18 [2019-10-03 02:31:01,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:01,981 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2019-10-03 02:31:01,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:01,981 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2019-10-03 02:31:01,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-03 02:31:01,982 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:01,983 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:01,983 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:01,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:01,983 INFO L82 PathProgramCache]: Analyzing trace with hash 894112118, now seen corresponding path program 1 times [2019-10-03 02:31:01,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:01,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:01,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:02,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:02,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:02,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:02,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:02,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:02,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:02,016 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand 3 states. [2019-10-03 02:31:02,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:02,040 INFO L93 Difference]: Finished difference Result 154 states and 243 transitions. [2019-10-03 02:31:02,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:02,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-03 02:31:02,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:02,043 INFO L225 Difference]: With dead ends: 154 [2019-10-03 02:31:02,043 INFO L226 Difference]: Without dead ends: 154 [2019-10-03 02:31:02,043 INFO L640 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-10-03 02:31:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-03 02:31:02,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2019-10-03 02:31:02,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-03 02:31:02,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2019-10-03 02:31:02,055 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 18 [2019-10-03 02:31:02,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:02,055 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2019-10-03 02:31:02,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2019-10-03 02:31:02,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-03 02:31:02,057 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:02,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:02,058 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:02,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:02,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170488, now seen corresponding path program 1 times [2019-10-03 02:31:02,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:02,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:02,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:02,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:02,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:02,104 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:02,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:02,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:02,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:02,105 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand 3 states. [2019-10-03 02:31:02,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:02,128 INFO L93 Difference]: Finished difference Result 162 states and 243 transitions. [2019-10-03 02:31:02,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:02,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-03 02:31:02,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:02,133 INFO L225 Difference]: With dead ends: 162 [2019-10-03 02:31:02,133 INFO L226 Difference]: Without dead ends: 162 [2019-10-03 02:31:02,133 INFO L640 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-10-03 02:31:02,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-03 02:31:02,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-10-03 02:31:02,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-03 02:31:02,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2019-10-03 02:31:02,157 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 18 [2019-10-03 02:31:02,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:02,158 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2019-10-03 02:31:02,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:02,158 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2019-10-03 02:31:02,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-03 02:31:02,160 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:02,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:02,160 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:02,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:02,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1947887240, now seen corresponding path program 1 times [2019-10-03 02:31:02,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:02,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:02,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:02,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:02,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:02,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:02,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:02,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:02,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:02,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:02,203 INFO L87 Difference]: Start difference. First operand 160 states and 242 transitions. Second operand 3 states. [2019-10-03 02:31:02,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:02,224 INFO L93 Difference]: Finished difference Result 166 states and 243 transitions. [2019-10-03 02:31:02,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:02,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-03 02:31:02,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:02,225 INFO L225 Difference]: With dead ends: 166 [2019-10-03 02:31:02,226 INFO L226 Difference]: Without dead ends: 166 [2019-10-03 02:31:02,226 INFO L640 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-10-03 02:31:02,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-03 02:31:02,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-10-03 02:31:02,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-03 02:31:02,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2019-10-03 02:31:02,234 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 19 [2019-10-03 02:31:02,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:02,235 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2019-10-03 02:31:02,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:02,235 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2019-10-03 02:31:02,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-03 02:31:02,237 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:02,237 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:02,237 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:02,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:02,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1554860230, now seen corresponding path program 1 times [2019-10-03 02:31:02,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:02,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:02,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:02,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:02,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:02,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:02,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:02,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:02,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:02,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:02,275 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand 3 states. [2019-10-03 02:31:02,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:02,293 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2019-10-03 02:31:02,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:02,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-03 02:31:02,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:02,296 INFO L225 Difference]: With dead ends: 282 [2019-10-03 02:31:02,296 INFO L226 Difference]: Without dead ends: 282 [2019-10-03 02:31:02,297 INFO L640 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-10-03 02:31:02,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-10-03 02:31:02,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2019-10-03 02:31:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-03 02:31:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2019-10-03 02:31:02,311 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 19 [2019-10-03 02:31:02,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:02,312 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2019-10-03 02:31:02,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:02,312 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2019-10-03 02:31:02,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-03 02:31:02,314 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:02,314 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:02,315 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:02,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:02,315 INFO L82 PathProgramCache]: Analyzing trace with hash -2060048696, now seen corresponding path program 1 times [2019-10-03 02:31:02,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:02,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:02,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:02,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:02,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:02,369 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:02,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:02,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:02,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:02,370 INFO L87 Difference]: Start difference. First operand 232 states and 334 transitions. Second operand 3 states. [2019-10-03 02:31:02,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:02,388 INFO L93 Difference]: Finished difference Result 306 states and 423 transitions. [2019-10-03 02:31:02,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:02,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-03 02:31:02,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:02,393 INFO L225 Difference]: With dead ends: 306 [2019-10-03 02:31:02,393 INFO L226 Difference]: Without dead ends: 306 [2019-10-03 02:31:02,393 INFO L640 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-10-03 02:31:02,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-03 02:31:02,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-10-03 02:31:02,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-03 02:31:02,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2019-10-03 02:31:02,402 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 19 [2019-10-03 02:31:02,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:02,403 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2019-10-03 02:31:02,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:02,403 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2019-10-03 02:31:02,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:31:02,409 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:02,409 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:02,409 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:02,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:02,409 INFO L82 PathProgramCache]: Analyzing trace with hash 956242573, now seen corresponding path program 1 times [2019-10-03 02:31:02,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:02,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:02,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:02,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:02,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:02,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:02,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:02,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:02,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:02,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:02,442 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 3 states. [2019-10-03 02:31:02,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:02,458 INFO L93 Difference]: Finished difference Result 314 states and 423 transitions. [2019-10-03 02:31:02,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:02,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-03 02:31:02,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:02,461 INFO L225 Difference]: With dead ends: 314 [2019-10-03 02:31:02,461 INFO L226 Difference]: Without dead ends: 314 [2019-10-03 02:31:02,463 INFO L640 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-10-03 02:31:02,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-10-03 02:31:02,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2019-10-03 02:31:02,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-10-03 02:31:02,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 422 transitions. [2019-10-03 02:31:02,473 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 422 transitions. Word has length 20 [2019-10-03 02:31:02,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:02,474 INFO L475 AbstractCegarLoop]: Abstraction has 312 states and 422 transitions. [2019-10-03 02:31:02,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:02,474 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 422 transitions. [2019-10-03 02:31:02,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:31:02,476 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:02,476 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:02,477 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:02,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:02,478 INFO L82 PathProgramCache]: Analyzing trace with hash 563215563, now seen corresponding path program 1 times [2019-10-03 02:31:02,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:02,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:02,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:02,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:02,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:02,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:02,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:02,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:02,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:02,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:02,518 INFO L87 Difference]: Start difference. First operand 312 states and 422 transitions. Second operand 3 states. [2019-10-03 02:31:02,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:02,538 INFO L93 Difference]: Finished difference Result 522 states and 695 transitions. [2019-10-03 02:31:02,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:02,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-03 02:31:02,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:02,543 INFO L225 Difference]: With dead ends: 522 [2019-10-03 02:31:02,544 INFO L226 Difference]: Without dead ends: 522 [2019-10-03 02:31:02,544 INFO L640 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-10-03 02:31:02,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-10-03 02:31:02,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2019-10-03 02:31:02,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-03 02:31:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2019-10-03 02:31:02,557 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 20 [2019-10-03 02:31:02,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:02,558 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2019-10-03 02:31:02,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:02,558 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2019-10-03 02:31:02,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:31:02,564 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:02,564 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:02,565 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:02,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:02,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1243273933, now seen corresponding path program 1 times [2019-10-03 02:31:02,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:02,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:02,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:02,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:02,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:02,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:02,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:02,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:02,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:02,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:02,618 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 3 states. [2019-10-03 02:31:02,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:02,637 INFO L93 Difference]: Finished difference Result 586 states and 727 transitions. [2019-10-03 02:31:02,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:02,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-03 02:31:02,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:02,642 INFO L225 Difference]: With dead ends: 586 [2019-10-03 02:31:02,642 INFO L226 Difference]: Without dead ends: 586 [2019-10-03 02:31:02,643 INFO L640 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-10-03 02:31:02,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-03 02:31:02,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-10-03 02:31:02,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-03 02:31:02,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 726 transitions. [2019-10-03 02:31:02,657 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 726 transitions. Word has length 20 [2019-10-03 02:31:02,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:02,657 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 726 transitions. [2019-10-03 02:31:02,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:02,657 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 726 transitions. [2019-10-03 02:31:02,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:31:02,660 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:02,660 INFO L411 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-10-03 02:31:02,660 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:02,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:02,661 INFO L82 PathProgramCache]: Analyzing trace with hash 280029309, now seen corresponding path program 1 times [2019-10-03 02:31:02,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:02,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:02,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:02,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:02,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:02,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:02,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:02,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:02,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:02,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:02,698 INFO L87 Difference]: Start difference. First operand 584 states and 726 transitions. Second operand 3 states. [2019-10-03 02:31:02,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:02,715 INFO L93 Difference]: Finished difference Result 602 states and 727 transitions. [2019-10-03 02:31:02,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:02,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-03 02:31:02,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:02,720 INFO L225 Difference]: With dead ends: 602 [2019-10-03 02:31:02,720 INFO L226 Difference]: Without dead ends: 602 [2019-10-03 02:31:02,722 INFO L640 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-10-03 02:31:02,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-03 02:31:02,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-10-03 02:31:02,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-03 02:31:02,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 726 transitions. [2019-10-03 02:31:02,736 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 726 transitions. Word has length 21 [2019-10-03 02:31:02,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:02,737 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 726 transitions. [2019-10-03 02:31:02,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:02,737 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 726 transitions. [2019-10-03 02:31:02,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:31:02,738 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:02,738 INFO L411 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-10-03 02:31:02,739 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:02,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:02,739 INFO L82 PathProgramCache]: Analyzing trace with hash -112997701, now seen corresponding path program 1 times [2019-10-03 02:31:02,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:02,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:02,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:02,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:02,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:02,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:02,765 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:02,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:02,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:02,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:02,766 INFO L87 Difference]: Start difference. First operand 600 states and 726 transitions. Second operand 3 states. [2019-10-03 02:31:02,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:02,788 INFO L93 Difference]: Finished difference Result 968 states and 1126 transitions. [2019-10-03 02:31:02,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:02,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-03 02:31:02,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:02,793 INFO L225 Difference]: With dead ends: 968 [2019-10-03 02:31:02,793 INFO L226 Difference]: Without dead ends: 968 [2019-10-03 02:31:02,794 INFO L640 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-10-03 02:31:02,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-10-03 02:31:02,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 904. [2019-10-03 02:31:02,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-10-03 02:31:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1062 transitions. [2019-10-03 02:31:02,815 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1062 transitions. Word has length 21 [2019-10-03 02:31:02,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:02,815 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1062 transitions. [2019-10-03 02:31:02,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:02,816 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1062 transitions. [2019-10-03 02:31:02,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:31:02,818 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:02,818 INFO L411 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-10-03 02:31:02,818 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:02,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:02,819 INFO L82 PathProgramCache]: Analyzing trace with hash 567060669, now seen corresponding path program 1 times [2019-10-03 02:31:02,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:02,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:02,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:02,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:02,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:02,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:02,839 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:02,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:02,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:02,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:02,840 INFO L87 Difference]: Start difference. First operand 904 states and 1062 transitions. Second operand 3 states. [2019-10-03 02:31:02,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:02,856 INFO L93 Difference]: Finished difference Result 1126 states and 1221 transitions. [2019-10-03 02:31:02,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:02,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-03 02:31:02,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:02,857 INFO L225 Difference]: With dead ends: 1126 [2019-10-03 02:31:02,858 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:31:02,858 INFO L640 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-10-03 02:31:02,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:31:02,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:31:02,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:31:02,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:31:02,859 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-10-03 02:31:02,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:02,859 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:31:02,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:02,859 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:31:02,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:31:02,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:31:02 BoogieIcfgContainer [2019-10-03 02:31:02,865 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:31:02,868 INFO L168 Benchmark]: Toolchain (without parser) took 2679.77 ms. Allocated memory was 131.1 MB in the beginning and 221.8 MB in the end (delta: 90.7 MB). Free memory was 86.2 MB in the beginning and 119.7 MB in the end (delta: -33.5 MB). Peak memory consumption was 57.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:31:02,869 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 131.1 MB. Free memory was 105.2 MB in the beginning and 105.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:31:02,870 INFO L168 Benchmark]: CACSL2BoogieTranslator took 503.92 ms. Allocated memory was 131.1 MB in the beginning and 201.3 MB in the end (delta: 70.3 MB). Free memory was 86.0 MB in the beginning and 178.8 MB in the end (delta: -92.9 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:31:02,871 INFO L168 Benchmark]: Boogie Preprocessor took 34.48 ms. Allocated memory is still 201.3 MB. Free memory was 178.8 MB in the beginning and 176.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:31:02,871 INFO L168 Benchmark]: RCFGBuilder took 310.08 ms. Allocated memory is still 201.3 MB. Free memory was 176.5 MB in the beginning and 160.8 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:31:02,872 INFO L168 Benchmark]: TraceAbstraction took 1826.93 ms. Allocated memory was 201.3 MB in the beginning and 221.8 MB in the end (delta: 20.4 MB). Free memory was 160.2 MB in the beginning and 119.7 MB in the end (delta: 40.5 MB). Peak memory consumption was 60.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:31:02,876 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 131.1 MB. Free memory was 105.2 MB in the beginning and 105.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 503.92 ms. Allocated memory was 131.1 MB in the beginning and 201.3 MB in the end (delta: 70.3 MB). Free memory was 86.0 MB in the beginning and 178.8 MB in the end (delta: -92.9 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.48 ms. Allocated memory is still 201.3 MB. Free memory was 178.8 MB in the beginning and 176.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 310.08 ms. Allocated memory is still 201.3 MB. Free memory was 176.5 MB in the beginning and 160.8 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1826.93 ms. Allocated memory was 201.3 MB in the beginning and 221.8 MB in the end (delta: 20.4 MB). Free memory was 160.2 MB in the beginning and 119.7 MB in the end (delta: 40.5 MB). Peak memory consumption was 60.9 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.6s 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.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s 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...