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-f4eb214f-m [2019-10-13 21:05:14,498 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:05:14,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:05:14,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:05:14,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:05:14,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:05:14,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:05:14,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:05:14,539 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:05:14,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:05:14,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:05:14,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:05:14,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:05:14,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:05:14,551 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:05:14,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:05:14,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:05:14,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:05:14,556 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:05:14,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:05:14,565 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:05:14,568 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:05:14,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:05:14,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:05:14,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:05:14,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:05:14,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:05:14,576 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:05:14,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:05:14,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:05:14,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:05:14,579 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:05:14,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:05:14,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:05:14,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:05:14,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:05:14,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:05:14,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:05:14,583 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:05:14,584 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:05:14,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:05:14,586 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-13 21:05:14,617 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:05:14,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:05:14,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:05:14,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:05:14,622 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:05:14,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:05:14,623 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:05:14,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:05:14,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:05:14,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:05:14,624 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:05:14,624 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:05:14,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:05:14,625 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:05:14,625 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:05:14,625 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:05:14,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:05:14,626 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:05:14,626 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:05:14,626 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:05:14,626 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:05:14,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:05:14,627 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:05:14,627 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:05:14,627 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:05:14,627 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:05:14,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:05:14,628 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:05:14,628 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-13 21:05:14,937 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:05:14,961 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:05:14,966 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:05:14,968 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:05:14,968 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:05:14,969 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-13 21:05:15,046 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7d24b2a/ca048e64da6d42a1b0f137cb874e1181/FLAG759c7d0c9 [2019-10-13 21:05:15,554 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:05:15,554 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2019-10-13 21:05:15,564 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7d24b2a/ca048e64da6d42a1b0f137cb874e1181/FLAG759c7d0c9 [2019-10-13 21:05:15,972 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7d24b2a/ca048e64da6d42a1b0f137cb874e1181 [2019-10-13 21:05:15,983 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:05:15,985 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:05:15,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:05:15,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:05:15,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:05:15,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:05:15" (1/1) ... [2019-10-13 21:05:15,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@372c657e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:15, skipping insertion in model container [2019-10-13 21:05:15,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:05:15" (1/1) ... [2019-10-13 21:05:16,003 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:05:16,023 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:05:16,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:05:16,282 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:05:16,316 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:05:16,333 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:05:16,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:16 WrapperNode [2019-10-13 21:05:16,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:05:16,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:05:16,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:05:16,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:05:16,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:16" (1/1) ... [2019-10-13 21:05:16,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:16" (1/1) ... [2019-10-13 21:05:16,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:16" (1/1) ... [2019-10-13 21:05:16,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:16" (1/1) ... [2019-10-13 21:05:16,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:16" (1/1) ... [2019-10-13 21:05:16,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:16" (1/1) ... [2019-10-13 21:05:16,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:16" (1/1) ... [2019-10-13 21:05:16,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:05:16,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:05:16,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:05:16,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:05:16,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:16" (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-13 21:05:16,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:05:16,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:05:16,532 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:05:16,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:05:16,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:05:16,533 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:05:16,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:05:16,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:05:16,775 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:05:16,777 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:05:16,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:05:16 BoogieIcfgContainer [2019-10-13 21:05:16,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:05:16,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:05:16,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:05:16,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:05:16,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:05:15" (1/3) ... [2019-10-13 21:05:16,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5db0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:05:16, skipping insertion in model container [2019-10-13 21:05:16,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:16" (2/3) ... [2019-10-13 21:05:16,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5db0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:05:16, skipping insertion in model container [2019-10-13 21:05:16,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:05:16" (3/3) ... [2019-10-13 21:05:16,806 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2019-10-13 21:05:16,834 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:05:16,852 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:05:16,868 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:05:16,902 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:05:16,903 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:05:16,903 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:05:16,903 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:05:16,903 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:05:16,904 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:05:16,904 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:05:16,904 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:05:16,921 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-10-13 21:05:16,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 21:05:16,926 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:16,927 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:16,928 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:16,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:16,933 INFO L82 PathProgramCache]: Analyzing trace with hash 316328318, now seen corresponding path program 1 times [2019-10-13 21:05:16,943 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:16,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875180950] [2019-10-13 21:05:16,943 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:16,944 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:16,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:17,097 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-13 21:05:17,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875180950] [2019-10-13 21:05:17,099 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:17,099 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:17,099 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896093972] [2019-10-13 21:05:17,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:17,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:17,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:17,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:17,118 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2019-10-13 21:05:17,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:17,190 INFO L93 Difference]: Finished difference Result 57 states and 90 transitions. [2019-10-13 21:05:17,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:17,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-13 21:05:17,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:17,203 INFO L225 Difference]: With dead ends: 57 [2019-10-13 21:05:17,203 INFO L226 Difference]: Without dead ends: 42 [2019-10-13 21:05:17,206 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-13 21:05:17,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-13 21:05:17,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-10-13 21:05:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-13 21:05:17,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2019-10-13 21:05:17,246 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 15 [2019-10-13 21:05:17,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:17,247 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2019-10-13 21:05:17,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2019-10-13 21:05:17,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 21:05:17,249 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:17,249 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:17,249 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:17,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:17,250 INFO L82 PathProgramCache]: Analyzing trace with hash -493018308, now seen corresponding path program 1 times [2019-10-13 21:05:17,250 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:17,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321680982] [2019-10-13 21:05:17,251 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:17,251 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:17,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:17,320 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-13 21:05:17,320 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321680982] [2019-10-13 21:05:17,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:17,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:17,325 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200488348] [2019-10-13 21:05:17,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:17,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:17,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:17,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:17,328 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. [2019-10-13 21:05:17,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:17,355 INFO L93 Difference]: Finished difference Result 67 states and 112 transitions. [2019-10-13 21:05:17,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:17,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-13 21:05:17,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:17,357 INFO L225 Difference]: With dead ends: 67 [2019-10-13 21:05:17,357 INFO L226 Difference]: Without dead ends: 42 [2019-10-13 21:05:17,359 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-13 21:05:17,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-13 21:05:17,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-10-13 21:05:17,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-13 21:05:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2019-10-13 21:05:17,367 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 15 [2019-10-13 21:05:17,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:17,368 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2019-10-13 21:05:17,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:17,368 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2019-10-13 21:05:17,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 21:05:17,369 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:17,369 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:17,370 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:17,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:17,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1216458266, now seen corresponding path program 1 times [2019-10-13 21:05:17,371 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:17,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153092673] [2019-10-13 21:05:17,371 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:17,371 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:17,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:17,428 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-13 21:05:17,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153092673] [2019-10-13 21:05:17,429 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:17,429 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:17,429 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496394300] [2019-10-13 21:05:17,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:17,430 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:17,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:17,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:17,431 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 3 states. [2019-10-13 21:05:17,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:17,469 INFO L93 Difference]: Finished difference Result 63 states and 99 transitions. [2019-10-13 21:05:17,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:17,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-13 21:05:17,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:17,471 INFO L225 Difference]: With dead ends: 63 [2019-10-13 21:05:17,472 INFO L226 Difference]: Without dead ends: 45 [2019-10-13 21:05:17,472 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-13 21:05:17,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-13 21:05:17,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-10-13 21:05:17,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-13 21:05:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2019-10-13 21:05:17,482 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 16 [2019-10-13 21:05:17,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:17,482 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2019-10-13 21:05:17,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:17,483 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2019-10-13 21:05:17,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 21:05:17,484 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:17,484 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:17,484 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:17,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:17,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1896516636, now seen corresponding path program 1 times [2019-10-13 21:05:17,485 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:17,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29214742] [2019-10-13 21:05:17,485 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:17,486 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:17,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:17,522 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-13 21:05:17,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29214742] [2019-10-13 21:05:17,522 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:17,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:17,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964796217] [2019-10-13 21:05:17,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:17,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:17,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:17,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:17,525 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 3 states. [2019-10-13 21:05:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:17,547 INFO L93 Difference]: Finished difference Result 76 states and 120 transitions. [2019-10-13 21:05:17,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:17,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-13 21:05:17,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:17,549 INFO L225 Difference]: With dead ends: 76 [2019-10-13 21:05:17,550 INFO L226 Difference]: Without dead ends: 74 [2019-10-13 21:05:17,550 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-13 21:05:17,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-13 21:05:17,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2019-10-13 21:05:17,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-13 21:05:17,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 88 transitions. [2019-10-13 21:05:17,564 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 88 transitions. Word has length 16 [2019-10-13 21:05:17,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:17,564 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 88 transitions. [2019-10-13 21:05:17,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:17,565 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 88 transitions. [2019-10-13 21:05:17,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 21:05:17,566 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:17,566 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:17,566 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:17,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:17,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1087170010, now seen corresponding path program 1 times [2019-10-13 21:05:17,567 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:17,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336826699] [2019-10-13 21:05:17,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:17,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:17,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:17,597 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-13 21:05:17,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336826699] [2019-10-13 21:05:17,598 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:17,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:17,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665905102] [2019-10-13 21:05:17,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:17,599 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:17,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:17,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:17,600 INFO L87 Difference]: Start difference. First operand 56 states and 88 transitions. Second operand 3 states. [2019-10-13 21:05:17,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:17,624 INFO L93 Difference]: Finished difference Result 124 states and 198 transitions. [2019-10-13 21:05:17,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:17,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-13 21:05:17,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:17,626 INFO L225 Difference]: With dead ends: 124 [2019-10-13 21:05:17,626 INFO L226 Difference]: Without dead ends: 76 [2019-10-13 21:05:17,627 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-13 21:05:17,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-13 21:05:17,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-10-13 21:05:17,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-13 21:05:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2019-10-13 21:05:17,637 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 16 [2019-10-13 21:05:17,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:17,637 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2019-10-13 21:05:17,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:17,638 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2019-10-13 21:05:17,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:05:17,639 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:17,639 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:17,639 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:17,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:17,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1337311087, now seen corresponding path program 1 times [2019-10-13 21:05:17,640 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:17,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353362137] [2019-10-13 21:05:17,640 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:17,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:17,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:17,676 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-13 21:05:17,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353362137] [2019-10-13 21:05:17,677 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:17,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:17,677 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727788605] [2019-10-13 21:05:17,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:17,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:17,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:17,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:17,679 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand 3 states. [2019-10-13 21:05:17,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:17,705 INFO L93 Difference]: Finished difference Result 111 states and 169 transitions. [2019-10-13 21:05:17,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:17,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-13 21:05:17,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:17,707 INFO L225 Difference]: With dead ends: 111 [2019-10-13 21:05:17,707 INFO L226 Difference]: Without dead ends: 78 [2019-10-13 21:05:17,708 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-13 21:05:17,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-13 21:05:17,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-10-13 21:05:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-13 21:05:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2019-10-13 21:05:17,717 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 17 [2019-10-13 21:05:17,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:17,717 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2019-10-13 21:05:17,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2019-10-13 21:05:17,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:05:17,718 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:17,719 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:17,719 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:17,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:17,719 INFO L82 PathProgramCache]: Analyzing trace with hash -657252717, now seen corresponding path program 1 times [2019-10-13 21:05:17,720 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:17,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013060088] [2019-10-13 21:05:17,720 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:17,720 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:17,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:17,775 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-13 21:05:17,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013060088] [2019-10-13 21:05:17,776 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:17,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:17,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631456755] [2019-10-13 21:05:17,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:17,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:17,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:17,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:17,778 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand 3 states. [2019-10-13 21:05:17,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:17,800 INFO L93 Difference]: Finished difference Result 132 states and 200 transitions. [2019-10-13 21:05:17,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:17,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-13 21:05:17,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:17,803 INFO L225 Difference]: With dead ends: 132 [2019-10-13 21:05:17,803 INFO L226 Difference]: Without dead ends: 130 [2019-10-13 21:05:17,803 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-13 21:05:17,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-13 21:05:17,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2019-10-13 21:05:17,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-13 21:05:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-10-13 21:05:17,815 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 17 [2019-10-13 21:05:17,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:17,815 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2019-10-13 21:05:17,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:17,816 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2019-10-13 21:05:17,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:05:17,817 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:17,817 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:17,818 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:17,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:17,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1466599343, now seen corresponding path program 1 times [2019-10-13 21:05:17,818 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:17,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970462350] [2019-10-13 21:05:17,819 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:17,819 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:17,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:17,858 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-13 21:05:17,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970462350] [2019-10-13 21:05:17,858 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:17,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:17,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597407581] [2019-10-13 21:05:17,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:17,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:17,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:17,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:17,861 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 3 states. [2019-10-13 21:05:17,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:17,881 INFO L93 Difference]: Finished difference Result 232 states and 344 transitions. [2019-10-13 21:05:17,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:17,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-13 21:05:17,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:17,884 INFO L225 Difference]: With dead ends: 232 [2019-10-13 21:05:17,884 INFO L226 Difference]: Without dead ends: 138 [2019-10-13 21:05:17,885 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-13 21:05:17,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-13 21:05:17,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-10-13 21:05:17,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-13 21:05:17,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2019-10-13 21:05:17,899 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 17 [2019-10-13 21:05:17,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:17,899 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2019-10-13 21:05:17,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:17,899 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2019-10-13 21:05:17,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:05:17,901 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:17,901 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-13 21:05:17,901 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:17,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:17,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1100217935, now seen corresponding path program 1 times [2019-10-13 21:05:17,902 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:17,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505537129] [2019-10-13 21:05:17,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:17,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:17,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:17,933 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-13 21:05:17,934 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505537129] [2019-10-13 21:05:17,934 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:17,934 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:17,935 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860897731] [2019-10-13 21:05:17,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:17,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:17,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:17,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:17,936 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand 3 states. [2019-10-13 21:05:17,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:17,979 INFO L93 Difference]: Finished difference Result 204 states and 288 transitions. [2019-10-13 21:05:17,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:17,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 21:05:17,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:17,981 INFO L225 Difference]: With dead ends: 204 [2019-10-13 21:05:17,981 INFO L226 Difference]: Without dead ends: 142 [2019-10-13 21:05:17,982 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-13 21:05:17,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-13 21:05:18,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2019-10-13 21:05:18,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-13 21:05:18,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2019-10-13 21:05:18,006 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 18 [2019-10-13 21:05:18,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:18,006 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2019-10-13 21:05:18,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:18,007 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2019-10-13 21:05:18,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:05:18,008 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:18,008 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-13 21:05:18,009 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:18,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:18,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1780276305, now seen corresponding path program 1 times [2019-10-13 21:05:18,009 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:18,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864049059] [2019-10-13 21:05:18,010 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,010 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:18,034 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-13 21:05:18,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864049059] [2019-10-13 21:05:18,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:18,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:18,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034552567] [2019-10-13 21:05:18,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:18,041 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:18,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:18,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:18,042 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 3 states. [2019-10-13 21:05:18,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:18,074 INFO L93 Difference]: Finished difference Result 236 states and 328 transitions. [2019-10-13 21:05:18,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:18,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 21:05:18,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:18,076 INFO L225 Difference]: With dead ends: 236 [2019-10-13 21:05:18,077 INFO L226 Difference]: Without dead ends: 234 [2019-10-13 21:05:18,077 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-13 21:05:18,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-13 21:05:18,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 200. [2019-10-13 21:05:18,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-13 21:05:18,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 270 transitions. [2019-10-13 21:05:18,094 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 270 transitions. Word has length 18 [2019-10-13 21:05:18,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:18,094 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 270 transitions. [2019-10-13 21:05:18,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:18,095 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 270 transitions. [2019-10-13 21:05:18,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:05:18,097 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:18,097 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-13 21:05:18,097 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:18,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:18,098 INFO L82 PathProgramCache]: Analyzing trace with hash 970929679, now seen corresponding path program 1 times [2019-10-13 21:05:18,098 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:18,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466805948] [2019-10-13 21:05:18,098 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,098 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:18,126 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-13 21:05:18,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466805948] [2019-10-13 21:05:18,126 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:18,127 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:18,127 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127285632] [2019-10-13 21:05:18,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:18,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:18,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:18,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:18,128 INFO L87 Difference]: Start difference. First operand 200 states and 270 transitions. Second operand 3 states. [2019-10-13 21:05:18,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:18,154 INFO L93 Difference]: Finished difference Result 444 states and 592 transitions. [2019-10-13 21:05:18,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:18,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 21:05:18,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:18,156 INFO L225 Difference]: With dead ends: 444 [2019-10-13 21:05:18,156 INFO L226 Difference]: Without dead ends: 258 [2019-10-13 21:05:18,158 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-13 21:05:18,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-13 21:05:18,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-10-13 21:05:18,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-10-13 21:05:18,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 326 transitions. [2019-10-13 21:05:18,172 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 326 transitions. Word has length 18 [2019-10-13 21:05:18,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:18,172 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 326 transitions. [2019-10-13 21:05:18,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:18,173 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 326 transitions. [2019-10-13 21:05:18,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:05:18,175 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:18,175 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-13 21:05:18,175 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:18,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:18,175 INFO L82 PathProgramCache]: Analyzing trace with hash -645793370, now seen corresponding path program 1 times [2019-10-13 21:05:18,176 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:18,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224112018] [2019-10-13 21:05:18,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:18,212 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-13 21:05:18,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224112018] [2019-10-13 21:05:18,213 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:18,213 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:18,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29705026] [2019-10-13 21:05:18,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:18,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:18,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:18,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:18,215 INFO L87 Difference]: Start difference. First operand 256 states and 326 transitions. Second operand 3 states. [2019-10-13 21:05:18,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:18,241 INFO L93 Difference]: Finished difference Result 384 states and 484 transitions. [2019-10-13 21:05:18,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:18,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 21:05:18,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:18,243 INFO L225 Difference]: With dead ends: 384 [2019-10-13 21:05:18,243 INFO L226 Difference]: Without dead ends: 266 [2019-10-13 21:05:18,244 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-13 21:05:18,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-10-13 21:05:18,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2019-10-13 21:05:18,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-10-13 21:05:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 326 transitions. [2019-10-13 21:05:18,264 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 326 transitions. Word has length 19 [2019-10-13 21:05:18,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:18,264 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 326 transitions. [2019-10-13 21:05:18,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:18,264 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 326 transitions. [2019-10-13 21:05:18,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:05:18,270 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:18,271 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-13 21:05:18,271 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:18,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:18,271 INFO L82 PathProgramCache]: Analyzing trace with hash 34265000, now seen corresponding path program 1 times [2019-10-13 21:05:18,272 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:18,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172124125] [2019-10-13 21:05:18,272 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,272 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:18,329 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-13 21:05:18,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172124125] [2019-10-13 21:05:18,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:18,331 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:18,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145190000] [2019-10-13 21:05:18,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:18,331 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:18,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:18,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:18,332 INFO L87 Difference]: Start difference. First operand 264 states and 326 transitions. Second operand 3 states. [2019-10-13 21:05:18,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:18,362 INFO L93 Difference]: Finished difference Result 426 states and 519 transitions. [2019-10-13 21:05:18,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:18,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 21:05:18,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:18,370 INFO L225 Difference]: With dead ends: 426 [2019-10-13 21:05:18,370 INFO L226 Difference]: Without dead ends: 424 [2019-10-13 21:05:18,371 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-13 21:05:18,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-10-13 21:05:18,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 392. [2019-10-13 21:05:18,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-10-13 21:05:18,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 470 transitions. [2019-10-13 21:05:18,388 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 470 transitions. Word has length 19 [2019-10-13 21:05:18,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:18,388 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 470 transitions. [2019-10-13 21:05:18,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:18,388 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 470 transitions. [2019-10-13 21:05:18,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:05:18,389 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:18,390 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-13 21:05:18,390 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:18,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:18,390 INFO L82 PathProgramCache]: Analyzing trace with hash -775081626, now seen corresponding path program 1 times [2019-10-13 21:05:18,390 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:18,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269039168] [2019-10-13 21:05:18,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:18,429 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-13 21:05:18,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269039168] [2019-10-13 21:05:18,431 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:18,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:18,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087390235] [2019-10-13 21:05:18,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:18,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:18,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:18,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:18,433 INFO L87 Difference]: Start difference. First operand 392 states and 470 transitions. Second operand 3 states. [2019-10-13 21:05:18,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:18,464 INFO L93 Difference]: Finished difference Result 856 states and 998 transitions. [2019-10-13 21:05:18,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:18,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 21:05:18,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:18,466 INFO L225 Difference]: With dead ends: 856 [2019-10-13 21:05:18,468 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:05:18,471 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-13 21:05:18,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:05:18,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:05:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:05:18,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:05:18,473 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-10-13 21:05:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:18,473 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:05:18,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:18,473 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:05:18,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:05:18,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:05:18,505 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-13 21:05:18,505 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:05:18,505 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:05:18,505 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 21:05:18,506 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:05:18,506 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:05:18,506 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-13 21:05:18,506 INFO L446 ceAbstractionStarter]: At program point L89(lines 5 93) the Hoare annotation is: true [2019-10-13 21:05:18,506 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 93) no Hoare annotation was computed. [2019-10-13 21:05:18,506 INFO L443 ceAbstractionStarter]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2019-10-13 21:05:18,506 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-10-13 21:05:18,506 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2019-10-13 21:05:18,507 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2019-10-13 21:05:18,507 INFO L443 ceAbstractionStarter]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2019-10-13 21:05:18,507 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2019-10-13 21:05:18,507 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2019-10-13 21:05:18,507 INFO L443 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-10-13 21:05:18,507 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-10-13 21:05:18,507 INFO L443 ceAbstractionStarter]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2019-10-13 21:05:18,508 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2019-10-13 21:05:18,508 INFO L446 ceAbstractionStarter]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2019-10-13 21:05:18,508 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-13 21:05:18,509 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 93) no Hoare annotation was computed. [2019-10-13 21:05:18,509 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2019-10-13 21:05:18,509 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2019-10-13 21:05:18,509 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2019-10-13 21:05:18,510 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-10-13 21:05:18,510 INFO L439 ceAbstractionStarter]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2019-10-13 21:05:18,510 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2019-10-13 21:05:18,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:05:18 BoogieIcfgContainer [2019-10-13 21:05:18,521 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 21:05:18,527 INFO L168 Benchmark]: Toolchain (without parser) took 2538.15 ms. Allocated memory was 145.2 MB in the beginning and 235.4 MB in the end (delta: 90.2 MB). Free memory was 102.8 MB in the beginning and 152.1 MB in the end (delta: -49.3 MB). Peak memory consumption was 40.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:18,532 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 21:05:18,532 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.36 ms. Allocated memory is still 145.2 MB. Free memory was 102.6 MB in the beginning and 92.8 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:18,534 INFO L168 Benchmark]: Boogie Preprocessor took 133.51 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 92.8 MB in the beginning and 181.1 MB in the end (delta: -88.3 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:18,534 INFO L168 Benchmark]: RCFGBuilder took 309.84 ms. Allocated memory is still 202.9 MB. Free memory was 181.1 MB in the beginning and 166.2 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:18,537 INFO L168 Benchmark]: TraceAbstraction took 1741.06 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 166.2 MB in the beginning and 152.1 MB in the end (delta: 14.1 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:18,547 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 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 348.36 ms. Allocated memory is still 145.2 MB. Free memory was 102.6 MB in the beginning and 92.8 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.51 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 92.8 MB in the beginning and 181.1 MB in the end (delta: -88.3 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 309.84 ms. Allocated memory is still 202.9 MB. Free memory was 181.1 MB in the beginning and 166.2 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1741.06 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 166.2 MB in the beginning and 152.1 MB in the end (delta: 14.1 MB). Peak memory consumption was 46.6 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.2s 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.4s 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...