java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/locks/test_locks_5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:04:14,142 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:04:14,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:04:14,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:04:14,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:04:14,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:04:14,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:04:14,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:04:14,163 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:04:14,164 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:04:14,165 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:04:14,166 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:04:14,167 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:04:14,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:04:14,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:04:14,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:04:14,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:04:14,172 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:04:14,173 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:04:14,175 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:04:14,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:04:14,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:04:14,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:04:14,180 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:04:14,183 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:04:14,183 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:04:14,183 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:04:14,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:04:14,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:04:14,185 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:04:14,186 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:04:14,187 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:04:14,187 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:04:14,188 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:04:14,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:04:14,189 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:04:14,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:04:14,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:04:14,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:04:14,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:04:14,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:04:14,194 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:04:14,218 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:04:14,218 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:04:14,222 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:04:14,223 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:04:14,223 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:04:14,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:04:14,224 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:04:14,224 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:04:14,224 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:04:14,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:04:14,225 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:04:14,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:04:14,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:04:14,226 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:04:14,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:04:14,227 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:04:14,227 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:04:14,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:04:14,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:04:14,228 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:04:14,229 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:04:14,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:04:14,230 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:04:14,230 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:04:14,230 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:04:14,230 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:04:14,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:04:14,231 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:04:14,231 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:04:14,501 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:04:14,513 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:04:14,517 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:04:14,518 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:04:14,519 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:04:14,519 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2019-10-15 01:04:14,577 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba64ee6bc/e9b0249145d24a0f8577059db8421260/FLAG90db68dbd [2019-10-15 01:04:15,049 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:04:15,051 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2019-10-15 01:04:15,061 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba64ee6bc/e9b0249145d24a0f8577059db8421260/FLAG90db68dbd [2019-10-15 01:04:15,449 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba64ee6bc/e9b0249145d24a0f8577059db8421260 [2019-10-15 01:04:15,461 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:04:15,462 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:04:15,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:04:15,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:04:15,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:04:15,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:04:15" (1/1) ... [2019-10-15 01:04:15,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a725cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15, skipping insertion in model container [2019-10-15 01:04:15,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:04:15" (1/1) ... [2019-10-15 01:04:15,479 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:04:15,504 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:04:15,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:04:15,706 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:04:15,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:04:15,736 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:04:15,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15 WrapperNode [2019-10-15 01:04:15,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:04:15,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:04:15,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:04:15,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:04:15,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (1/1) ... [2019-10-15 01:04:15,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (1/1) ... [2019-10-15 01:04:15,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (1/1) ... [2019-10-15 01:04:15,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (1/1) ... [2019-10-15 01:04:15,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (1/1) ... [2019-10-15 01:04:15,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (1/1) ... [2019-10-15 01:04:15,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (1/1) ... [2019-10-15 01:04:15,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:04:15,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:04:15,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:04:15,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:04:15,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (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-15 01:04:15,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:04:15,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:04:15,915 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:04:15,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:04:15,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:04:15,915 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:04:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:04:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:04:16,179 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:04:16,179 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:04:16,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:04:16 BoogieIcfgContainer [2019-10-15 01:04:16,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:04:16,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:04:16,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:04:16,186 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:04:16,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:04:15" (1/3) ... [2019-10-15 01:04:16,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f908f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:04:16, skipping insertion in model container [2019-10-15 01:04:16,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (2/3) ... [2019-10-15 01:04:16,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f908f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:04:16, skipping insertion in model container [2019-10-15 01:04:16,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:04:16" (3/3) ... [2019-10-15 01:04:16,198 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2019-10-15 01:04:16,210 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:04:16,219 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:04:16,231 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:04:16,272 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:04:16,273 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:04:16,273 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:04:16,273 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:04:16,273 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:04:16,274 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:04:16,274 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:04:16,274 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:04:16,295 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-10-15 01:04:16,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 01:04:16,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,301 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,303 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,308 INFO L82 PathProgramCache]: Analyzing trace with hash 316328318, now seen corresponding path program 1 times [2019-10-15 01:04:16,318 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,319 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885014105] [2019-10-15 01:04:16,319 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,319 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,475 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-15 01:04:16,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885014105] [2019-10-15 01:04:16,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035097672] [2019-10-15 01:04:16,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,501 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2019-10-15 01:04:16,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,573 INFO L93 Difference]: Finished difference Result 57 states and 90 transitions. [2019-10-15 01:04:16,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-15 01:04:16,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,588 INFO L225 Difference]: With dead ends: 57 [2019-10-15 01:04:16,588 INFO L226 Difference]: Without dead ends: 42 [2019-10-15 01:04:16,592 INFO L600 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-15 01:04:16,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-15 01:04:16,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-10-15 01:04:16,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-15 01:04:16,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2019-10-15 01:04:16,643 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 15 [2019-10-15 01:04:16,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,644 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2019-10-15 01:04:16,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,645 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2019-10-15 01:04:16,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 01:04:16,646 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,646 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,647 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,647 INFO L82 PathProgramCache]: Analyzing trace with hash -493018308, now seen corresponding path program 1 times [2019-10-15 01:04:16,648 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194526354] [2019-10-15 01:04:16,648 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,649 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,715 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-15 01:04:16,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194526354] [2019-10-15 01:04:16,716 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995320282] [2019-10-15 01:04:16,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,720 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. [2019-10-15 01:04:16,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,759 INFO L93 Difference]: Finished difference Result 67 states and 112 transitions. [2019-10-15 01:04:16,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-15 01:04:16,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,762 INFO L225 Difference]: With dead ends: 67 [2019-10-15 01:04:16,762 INFO L226 Difference]: Without dead ends: 42 [2019-10-15 01:04:16,764 INFO L600 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-15 01:04:16,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-15 01:04:16,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-10-15 01:04:16,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-15 01:04:16,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2019-10-15 01:04:16,773 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 15 [2019-10-15 01:04:16,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,774 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2019-10-15 01:04:16,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,774 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2019-10-15 01:04:16,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 01:04:16,775 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,776 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,776 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1216458266, now seen corresponding path program 1 times [2019-10-15 01:04:16,777 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077269723] [2019-10-15 01:04:16,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,839 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-15 01:04:16,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077269723] [2019-10-15 01:04:16,840 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,840 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057322223] [2019-10-15 01:04:16,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,842 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 3 states. [2019-10-15 01:04:16,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,863 INFO L93 Difference]: Finished difference Result 63 states and 99 transitions. [2019-10-15 01:04:16,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-15 01:04:16,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,865 INFO L225 Difference]: With dead ends: 63 [2019-10-15 01:04:16,865 INFO L226 Difference]: Without dead ends: 45 [2019-10-15 01:04:16,866 INFO L600 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-15 01:04:16,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-15 01:04:16,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-10-15 01:04:16,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-15 01:04:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2019-10-15 01:04:16,878 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 16 [2019-10-15 01:04:16,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,879 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2019-10-15 01:04:16,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,879 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2019-10-15 01:04:16,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 01:04:16,884 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,884 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,885 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1896516636, now seen corresponding path program 1 times [2019-10-15 01:04:16,885 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500231206] [2019-10-15 01:04:16,886 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,887 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,945 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-15 01:04:16,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500231206] [2019-10-15 01:04:16,946 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765548251] [2019-10-15 01:04:16,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,948 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 3 states. [2019-10-15 01:04:16,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,974 INFO L93 Difference]: Finished difference Result 76 states and 120 transitions. [2019-10-15 01:04:16,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-15 01:04:16,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,976 INFO L225 Difference]: With dead ends: 76 [2019-10-15 01:04:16,976 INFO L226 Difference]: Without dead ends: 74 [2019-10-15 01:04:16,977 INFO L600 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-15 01:04:16,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-15 01:04:16,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2019-10-15 01:04:16,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-15 01:04:16,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 88 transitions. [2019-10-15 01:04:16,993 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 88 transitions. Word has length 16 [2019-10-15 01:04:16,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,994 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 88 transitions. [2019-10-15 01:04:16,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,994 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 88 transitions. [2019-10-15 01:04:16,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 01:04:16,999 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,999 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,999 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:17,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:17,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1087170010, now seen corresponding path program 1 times [2019-10-15 01:04:17,000 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:17,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133257230] [2019-10-15 01:04:17,001 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,001 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,053 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-15 01:04:17,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133257230] [2019-10-15 01:04:17,054 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141877440] [2019-10-15 01:04:17,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,055 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,056 INFO L87 Difference]: Start difference. First operand 56 states and 88 transitions. Second operand 3 states. [2019-10-15 01:04:17,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:17,075 INFO L93 Difference]: Finished difference Result 124 states and 198 transitions. [2019-10-15 01:04:17,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:17,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-15 01:04:17,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:17,077 INFO L225 Difference]: With dead ends: 124 [2019-10-15 01:04:17,077 INFO L226 Difference]: Without dead ends: 76 [2019-10-15 01:04:17,078 INFO L600 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-15 01:04:17,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-15 01:04:17,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-10-15 01:04:17,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-15 01:04:17,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2019-10-15 01:04:17,087 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 16 [2019-10-15 01:04:17,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:17,087 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2019-10-15 01:04:17,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:17,087 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2019-10-15 01:04:17,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 01:04:17,089 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:17,089 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:17,089 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:17,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:17,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1337311087, now seen corresponding path program 1 times [2019-10-15 01:04:17,090 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:17,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449550215] [2019-10-15 01:04:17,091 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,091 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,133 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-15 01:04:17,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449550215] [2019-10-15 01:04:17,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732716204] [2019-10-15 01:04:17,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,137 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,139 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand 3 states. [2019-10-15 01:04:17,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:17,166 INFO L93 Difference]: Finished difference Result 111 states and 169 transitions. [2019-10-15 01:04:17,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:17,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-15 01:04:17,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:17,170 INFO L225 Difference]: With dead ends: 111 [2019-10-15 01:04:17,170 INFO L226 Difference]: Without dead ends: 78 [2019-10-15 01:04:17,171 INFO L600 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-15 01:04:17,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-15 01:04:17,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-10-15 01:04:17,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-15 01:04:17,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2019-10-15 01:04:17,190 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 17 [2019-10-15 01:04:17,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:17,190 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2019-10-15 01:04:17,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:17,190 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2019-10-15 01:04:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 01:04:17,194 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:17,194 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:17,194 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:17,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:17,194 INFO L82 PathProgramCache]: Analyzing trace with hash -657252717, now seen corresponding path program 1 times [2019-10-15 01:04:17,195 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:17,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085697594] [2019-10-15 01:04:17,195 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,195 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,243 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-15 01:04:17,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085697594] [2019-10-15 01:04:17,244 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,244 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,245 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327697693] [2019-10-15 01:04:17,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,245 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,248 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand 3 states. [2019-10-15 01:04:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:17,271 INFO L93 Difference]: Finished difference Result 132 states and 200 transitions. [2019-10-15 01:04:17,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:17,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-15 01:04:17,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:17,273 INFO L225 Difference]: With dead ends: 132 [2019-10-15 01:04:17,273 INFO L226 Difference]: Without dead ends: 130 [2019-10-15 01:04:17,274 INFO L600 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-15 01:04:17,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-15 01:04:17,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2019-10-15 01:04:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-15 01:04:17,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-10-15 01:04:17,296 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 17 [2019-10-15 01:04:17,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:17,297 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2019-10-15 01:04:17,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:17,297 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2019-10-15 01:04:17,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 01:04:17,298 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:17,298 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:17,299 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:17,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:17,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1466599343, now seen corresponding path program 1 times [2019-10-15 01:04:17,302 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:17,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982125089] [2019-10-15 01:04:17,303 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,303 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,344 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-15 01:04:17,345 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982125089] [2019-10-15 01:04:17,345 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,345 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,346 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562993546] [2019-10-15 01:04:17,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,347 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 3 states. [2019-10-15 01:04:17,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:17,372 INFO L93 Difference]: Finished difference Result 232 states and 344 transitions. [2019-10-15 01:04:17,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:17,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-15 01:04:17,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:17,374 INFO L225 Difference]: With dead ends: 232 [2019-10-15 01:04:17,374 INFO L226 Difference]: Without dead ends: 138 [2019-10-15 01:04:17,375 INFO L600 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-15 01:04:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-15 01:04:17,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-10-15 01:04:17,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-15 01:04:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2019-10-15 01:04:17,388 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 17 [2019-10-15 01:04:17,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:17,388 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2019-10-15 01:04:17,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:17,388 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2019-10-15 01:04:17,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 01:04:17,390 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:17,390 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:17,390 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:17,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:17,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1100217935, now seen corresponding path program 1 times [2019-10-15 01:04:17,391 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:17,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563220687] [2019-10-15 01:04:17,392 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,392 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,419 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-15 01:04:17,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563220687] [2019-10-15 01:04:17,419 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,419 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,420 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306204476] [2019-10-15 01:04:17,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,422 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand 3 states. [2019-10-15 01:04:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:17,456 INFO L93 Difference]: Finished difference Result 204 states and 288 transitions. [2019-10-15 01:04:17,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:17,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-15 01:04:17,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:17,458 INFO L225 Difference]: With dead ends: 204 [2019-10-15 01:04:17,458 INFO L226 Difference]: Without dead ends: 142 [2019-10-15 01:04:17,459 INFO L600 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-15 01:04:17,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-15 01:04:17,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2019-10-15 01:04:17,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-15 01:04:17,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2019-10-15 01:04:17,471 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 18 [2019-10-15 01:04:17,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:17,471 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2019-10-15 01:04:17,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:17,471 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2019-10-15 01:04:17,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 01:04:17,473 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:17,473 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:17,473 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:17,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:17,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1780276305, now seen corresponding path program 1 times [2019-10-15 01:04:17,474 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:17,474 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300476010] [2019-10-15 01:04:17,474 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,474 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,504 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-15 01:04:17,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300476010] [2019-10-15 01:04:17,504 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251936104] [2019-10-15 01:04:17,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,507 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,508 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 3 states. [2019-10-15 01:04:17,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:17,532 INFO L93 Difference]: Finished difference Result 236 states and 328 transitions. [2019-10-15 01:04:17,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:17,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-15 01:04:17,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:17,534 INFO L225 Difference]: With dead ends: 236 [2019-10-15 01:04:17,535 INFO L226 Difference]: Without dead ends: 234 [2019-10-15 01:04:17,535 INFO L600 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-15 01:04:17,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-15 01:04:17,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 200. [2019-10-15 01:04:17,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-15 01:04:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 270 transitions. [2019-10-15 01:04:17,547 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 270 transitions. Word has length 18 [2019-10-15 01:04:17,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:17,547 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 270 transitions. [2019-10-15 01:04:17,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:17,547 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 270 transitions. [2019-10-15 01:04:17,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 01:04:17,549 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:17,549 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:17,549 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:17,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:17,550 INFO L82 PathProgramCache]: Analyzing trace with hash 970929679, now seen corresponding path program 1 times [2019-10-15 01:04:17,550 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:17,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318518745] [2019-10-15 01:04:17,550 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,550 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:17,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318518745] [2019-10-15 01:04:17,578 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,578 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043426249] [2019-10-15 01:04:17,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,578 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,579 INFO L87 Difference]: Start difference. First operand 200 states and 270 transitions. Second operand 3 states. [2019-10-15 01:04:17,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:17,601 INFO L93 Difference]: Finished difference Result 444 states and 592 transitions. [2019-10-15 01:04:17,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:17,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-15 01:04:17,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:17,603 INFO L225 Difference]: With dead ends: 444 [2019-10-15 01:04:17,603 INFO L226 Difference]: Without dead ends: 258 [2019-10-15 01:04:17,605 INFO L600 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-15 01:04:17,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-15 01:04:17,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-10-15 01:04:17,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-10-15 01:04:17,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 326 transitions. [2019-10-15 01:04:17,620 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 326 transitions. Word has length 18 [2019-10-15 01:04:17,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:17,620 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 326 transitions. [2019-10-15 01:04:17,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:17,621 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 326 transitions. [2019-10-15 01:04:17,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:04:17,622 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:17,622 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:17,623 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:17,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:17,623 INFO L82 PathProgramCache]: Analyzing trace with hash -645793370, now seen corresponding path program 1 times [2019-10-15 01:04:17,623 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:17,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202847641] [2019-10-15 01:04:17,624 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,624 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,645 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-15 01:04:17,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202847641] [2019-10-15 01:04:17,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884620048] [2019-10-15 01:04:17,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,647 INFO L87 Difference]: Start difference. First operand 256 states and 326 transitions. Second operand 3 states. [2019-10-15 01:04:17,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:17,670 INFO L93 Difference]: Finished difference Result 384 states and 484 transitions. [2019-10-15 01:04:17,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:17,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-15 01:04:17,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:17,672 INFO L225 Difference]: With dead ends: 384 [2019-10-15 01:04:17,672 INFO L226 Difference]: Without dead ends: 266 [2019-10-15 01:04:17,678 INFO L600 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-15 01:04:17,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-10-15 01:04:17,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2019-10-15 01:04:17,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-10-15 01:04:17,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 326 transitions. [2019-10-15 01:04:17,696 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 326 transitions. Word has length 19 [2019-10-15 01:04:17,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:17,697 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 326 transitions. [2019-10-15 01:04:17,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:17,697 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 326 transitions. [2019-10-15 01:04:17,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:04:17,703 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:17,703 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:17,704 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:17,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:17,704 INFO L82 PathProgramCache]: Analyzing trace with hash 34265000, now seen corresponding path program 1 times [2019-10-15 01:04:17,705 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:17,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853242044] [2019-10-15 01:04:17,705 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,705 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,743 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-15 01:04:17,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853242044] [2019-10-15 01:04:17,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137936554] [2019-10-15 01:04:17,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,746 INFO L87 Difference]: Start difference. First operand 264 states and 326 transitions. Second operand 3 states. [2019-10-15 01:04:17,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:17,772 INFO L93 Difference]: Finished difference Result 426 states and 519 transitions. [2019-10-15 01:04:17,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:17,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-15 01:04:17,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:17,776 INFO L225 Difference]: With dead ends: 426 [2019-10-15 01:04:17,776 INFO L226 Difference]: Without dead ends: 424 [2019-10-15 01:04:17,778 INFO L600 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-15 01:04:17,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-10-15 01:04:17,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 392. [2019-10-15 01:04:17,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-10-15 01:04:17,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 470 transitions. [2019-10-15 01:04:17,793 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 470 transitions. Word has length 19 [2019-10-15 01:04:17,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:17,793 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 470 transitions. [2019-10-15 01:04:17,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:17,794 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 470 transitions. [2019-10-15 01:04:17,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:04:17,795 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:17,795 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:17,795 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:17,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:17,796 INFO L82 PathProgramCache]: Analyzing trace with hash -775081626, now seen corresponding path program 1 times [2019-10-15 01:04:17,796 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:17,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516697614] [2019-10-15 01:04:17,796 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,796 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:17,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:17,824 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-15 01:04:17,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516697614] [2019-10-15 01:04:17,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:17,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:17,826 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300346061] [2019-10-15 01:04:17,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:17,826 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:17,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:17,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:17,827 INFO L87 Difference]: Start difference. First operand 392 states and 470 transitions. Second operand 3 states. [2019-10-15 01:04:17,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:17,857 INFO L93 Difference]: Finished difference Result 856 states and 998 transitions. [2019-10-15 01:04:17,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:17,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-15 01:04:17,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:17,858 INFO L225 Difference]: With dead ends: 856 [2019-10-15 01:04:17,858 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:04:17,863 INFO L600 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-15 01:04:17,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:04:17,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:04:17,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:04:17,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:04:17,864 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-10-15 01:04:17,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:17,864 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:04:17,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:17,865 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:04:17,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:04:17,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:04:17,901 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 01:04:17,902 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:04:17,902 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:04:17,902 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 01:04:17,902 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:04:17,902 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:04:17,902 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-15 01:04:17,902 INFO L446 ceAbstractionStarter]: At program point L89(lines 5 93) the Hoare annotation is: true [2019-10-15 01:04:17,902 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 93) no Hoare annotation was computed. [2019-10-15 01:04:17,903 INFO L443 ceAbstractionStarter]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2019-10-15 01:04:17,903 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-10-15 01:04:17,903 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2019-10-15 01:04:17,903 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2019-10-15 01:04:17,903 INFO L443 ceAbstractionStarter]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2019-10-15 01:04:17,903 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2019-10-15 01:04:17,903 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2019-10-15 01:04:17,903 INFO L443 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-10-15 01:04:17,904 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-10-15 01:04:17,904 INFO L443 ceAbstractionStarter]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2019-10-15 01:04:17,904 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2019-10-15 01:04:17,904 INFO L446 ceAbstractionStarter]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2019-10-15 01:04:17,905 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-15 01:04:17,905 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 93) no Hoare annotation was computed. [2019-10-15 01:04:17,905 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2019-10-15 01:04:17,905 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2019-10-15 01:04:17,906 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2019-10-15 01:04:17,906 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-10-15 01:04:17,906 INFO L439 ceAbstractionStarter]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2019-10-15 01:04:17,906 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2019-10-15 01:04:17,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:04:17 BoogieIcfgContainer [2019-10-15 01:04:17,916 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:04:17,920 INFO L168 Benchmark]: Toolchain (without parser) took 2455.55 ms. Allocated memory was 138.9 MB in the beginning and 234.4 MB in the end (delta: 95.4 MB). Free memory was 103.2 MB in the beginning and 149.3 MB in the end (delta: -46.1 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:17,926 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 01:04:17,926 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.86 ms. Allocated memory is still 138.9 MB. Free memory was 103.0 MB in the beginning and 93.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:17,928 INFO L168 Benchmark]: Boogie Preprocessor took 123.21 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 93.0 MB in the beginning and 181.4 MB in the end (delta: -88.4 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:17,928 INFO L168 Benchmark]: RCFGBuilder took 320.20 ms. Allocated memory is still 203.4 MB. Free memory was 181.4 MB in the beginning and 166.8 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:17,932 INFO L168 Benchmark]: TraceAbstraction took 1733.30 ms. Allocated memory was 203.4 MB in the beginning and 234.4 MB in the end (delta: 30.9 MB). Free memory was 166.8 MB in the beginning and 149.3 MB in the end (delta: 17.5 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:17,944 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.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 273.86 ms. Allocated memory is still 138.9 MB. Free memory was 103.0 MB in the beginning and 93.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.21 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 93.0 MB in the beginning and 181.4 MB in the end (delta: -88.4 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 320.20 ms. Allocated memory is still 203.4 MB. Free memory was 181.4 MB in the beginning and 166.8 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1733.30 ms. Allocated memory was 203.4 MB in the beginning and 234.4 MB in the end (delta: 30.9 MB). Free memory was 166.8 MB in the beginning and 149.3 MB in the end (delta: 17.5 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Result: SAFE, OverallTime: 1.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 654 SDtfs, 285 SDslu, 428 SDs, 0 SdLazy, 75 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 138 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 42 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 6424 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...