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_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:05:16,081 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:05:16,082 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:05:16,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:05:16,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:05:16,096 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:05:16,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:05:16,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:05:16,101 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:05:16,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:05:16,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:05:16,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:05:16,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:05:16,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:05:16,119 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:05:16,121 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:05:16,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:05:16,125 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:05:16,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:05:16,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:05:16,131 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:05:16,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:05:16,135 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:05:16,136 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:05:16,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:05:16,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:05:16,142 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:05:16,143 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:05:16,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:05:16,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:05:16,146 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:05:16,148 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:05:16,149 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:05:16,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:05:16,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:05:16,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:05:16,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:05:16,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:05:16,152 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:05:16,153 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:05:16,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:05:16,154 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:16,174 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:05:16,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:05:16,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:05:16,176 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:05:16,177 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:05:16,177 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:05:16,177 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:05:16,177 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:05:16,177 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:05:16,178 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:05:16,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:05:16,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:05:16,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:05:16,180 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:05:16,180 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:05:16,180 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:05:16,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:05:16,181 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:05:16,181 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:05:16,181 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:05:16,181 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:05:16,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:05:16,182 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:05:16,182 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:05:16,182 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:05:16,182 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:05:16,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:05:16,183 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:05:16,183 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:16,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:05:16,487 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:05:16,491 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:05:16,493 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:05:16,493 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:05:16,494 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2019-10-13 21:05:16,558 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a1ea3dc7/4d1e9368dd8c495d9ec32b7aaca80e6c/FLAG1bd57d7c0 [2019-10-13 21:05:17,025 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:05:17,026 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2019-10-13 21:05:17,039 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a1ea3dc7/4d1e9368dd8c495d9ec32b7aaca80e6c/FLAG1bd57d7c0 [2019-10-13 21:05:17,446 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a1ea3dc7/4d1e9368dd8c495d9ec32b7aaca80e6c [2019-10-13 21:05:17,458 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:05:17,460 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:05:17,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:05:17,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:05:17,463 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:05:17,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:05:17" (1/1) ... [2019-10-13 21:05:17,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf90c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:17, skipping insertion in model container [2019-10-13 21:05:17,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:05:17" (1/1) ... [2019-10-13 21:05:17,473 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:05:17,493 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:05:17,685 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:05:17,690 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:05:17,722 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:05:17,738 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:05:17,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:17 WrapperNode [2019-10-13 21:05:17,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:05:17,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:05:17,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:05:17,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:05:17,854 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:17" (1/1) ... [2019-10-13 21:05:17,854 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:17" (1/1) ... [2019-10-13 21:05:17,860 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:17" (1/1) ... [2019-10-13 21:05:17,861 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:17" (1/1) ... [2019-10-13 21:05:17,866 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:17" (1/1) ... [2019-10-13 21:05:17,876 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:17" (1/1) ... [2019-10-13 21:05:17,877 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:17" (1/1) ... [2019-10-13 21:05:17,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:05:17,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:05:17,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:05:17,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:05:17,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:17" (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:17,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:05:17,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:05:17,953 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:05:17,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:05:17,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:05:17,954 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:05:17,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:05:17,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:05:18,194 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:05:18,195 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:05:18,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:05:18 BoogieIcfgContainer [2019-10-13 21:05:18,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:05:18,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:05:18,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:05:18,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:05:18,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:05:17" (1/3) ... [2019-10-13 21:05:18,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29061e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:05:18, skipping insertion in model container [2019-10-13 21:05:18,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:17" (2/3) ... [2019-10-13 21:05:18,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29061e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:05:18, skipping insertion in model container [2019-10-13 21:05:18,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:05:18" (3/3) ... [2019-10-13 21:05:18,204 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2019-10-13 21:05:18,215 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:05:18,224 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:05:18,240 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:05:18,270 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:05:18,270 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:05:18,271 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:05:18,271 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:05:18,271 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:05:18,271 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:05:18,272 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:05:18,272 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:05:18,296 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-10-13 21:05:18,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 21:05:18,305 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:18,306 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:18,309 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:18,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:18,317 INFO L82 PathProgramCache]: Analyzing trace with hash 429652513, now seen corresponding path program 1 times [2019-10-13 21:05:18,329 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:18,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788194911] [2019-10-13 21:05:18,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:18,502 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,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788194911] [2019-10-13 21:05:18,503 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:18,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:18,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465824721] [2019-10-13 21:05:18,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:18,510 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:18,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:18,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:18,527 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2019-10-13 21:05:18,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:18,589 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2019-10-13 21:05:18,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:18,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-13 21:05:18,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:18,604 INFO L225 Difference]: With dead ends: 63 [2019-10-13 21:05:18,604 INFO L226 Difference]: Without dead ends: 48 [2019-10-13 21:05:18,607 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,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-13 21:05:18,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-10-13 21:05:18,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-13 21:05:18,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2019-10-13 21:05:18,655 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 16 [2019-10-13 21:05:18,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:18,655 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2019-10-13 21:05:18,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:18,656 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2019-10-13 21:05:18,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 21:05:18,657 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:18,657 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:18,658 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:18,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:18,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1109710883, now seen corresponding path program 1 times [2019-10-13 21:05:18,659 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:18,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374567228] [2019-10-13 21:05:18,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:18,718 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,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374567228] [2019-10-13 21:05:18,719 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:18,719 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:18,719 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596660787] [2019-10-13 21:05:18,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:18,722 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:18,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:18,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:18,723 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2019-10-13 21:05:18,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:18,749 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2019-10-13 21:05:18,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:18,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-13 21:05:18,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:18,753 INFO L225 Difference]: With dead ends: 77 [2019-10-13 21:05:18,753 INFO L226 Difference]: Without dead ends: 48 [2019-10-13 21:05:18,754 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,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-13 21:05:18,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-10-13 21:05:18,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-13 21:05:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2019-10-13 21:05:18,770 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 16 [2019-10-13 21:05:18,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:18,770 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2019-10-13 21:05:18,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2019-10-13 21:05:18,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:05:18,771 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:18,771 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:18,772 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:18,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:18,772 INFO L82 PathProgramCache]: Analyzing trace with hash 434540691, now seen corresponding path program 1 times [2019-10-13 21:05:18,772 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:18,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149629462] [2019-10-13 21:05:18,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:18,820 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,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149629462] [2019-10-13 21:05:18,821 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:18,822 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:18,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142258488] [2019-10-13 21:05:18,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:18,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:18,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:18,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:18,824 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2019-10-13 21:05:18,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:18,854 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2019-10-13 21:05:18,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:18,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-13 21:05:18,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:18,858 INFO L225 Difference]: With dead ends: 72 [2019-10-13 21:05:18,859 INFO L226 Difference]: Without dead ends: 51 [2019-10-13 21:05:18,860 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,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-13 21:05:18,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-10-13 21:05:18,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-13 21:05:18,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2019-10-13 21:05:18,869 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 17 [2019-10-13 21:05:18,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:18,870 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2019-10-13 21:05:18,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:18,870 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2019-10-13 21:05:18,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:05:18,871 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:18,871 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:18,871 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:18,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:18,871 INFO L82 PathProgramCache]: Analyzing trace with hash 41513681, now seen corresponding path program 1 times [2019-10-13 21:05:18,872 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:18,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284931541] [2019-10-13 21:05:18,872 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,872 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:18,935 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,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284931541] [2019-10-13 21:05:18,937 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:18,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:18,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837023283] [2019-10-13 21:05:18,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:18,938 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:18,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:18,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:18,939 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 3 states. [2019-10-13 21:05:18,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:18,973 INFO L93 Difference]: Finished difference Result 88 states and 144 transitions. [2019-10-13 21:05:18,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:18,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-13 21:05:18,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:18,975 INFO L225 Difference]: With dead ends: 88 [2019-10-13 21:05:18,975 INFO L226 Difference]: Without dead ends: 86 [2019-10-13 21:05:18,975 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,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-13 21:05:18,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2019-10-13 21:05:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-13 21:05:18,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2019-10-13 21:05:18,989 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 17 [2019-10-13 21:05:18,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:18,989 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2019-10-13 21:05:18,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:18,990 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2019-10-13 21:05:18,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:05:18,991 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:18,991 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:18,991 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:18,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:18,991 INFO L82 PathProgramCache]: Analyzing trace with hash 721572051, now seen corresponding path program 1 times [2019-10-13 21:05:18,992 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:18,992 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710339901] [2019-10-13 21:05:18,992 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,992 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:18,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:19,025 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:19,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710339901] [2019-10-13 21:05:19,026 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:19,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:19,026 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857871556] [2019-10-13 21:05:19,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:19,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:19,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:19,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:19,028 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 3 states. [2019-10-13 21:05:19,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:19,054 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2019-10-13 21:05:19,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:19,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-13 21:05:19,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:19,056 INFO L225 Difference]: With dead ends: 144 [2019-10-13 21:05:19,056 INFO L226 Difference]: Without dead ends: 88 [2019-10-13 21:05:19,057 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:19,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-13 21:05:19,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-10-13 21:05:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-13 21:05:19,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2019-10-13 21:05:19,067 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 17 [2019-10-13 21:05:19,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:19,067 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2019-10-13 21:05:19,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:19,068 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2019-10-13 21:05:19,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:05:19,069 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:19,069 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:19,069 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:19,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:19,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1287139128, now seen corresponding path program 1 times [2019-10-13 21:05:19,070 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:19,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265152525] [2019-10-13 21:05:19,070 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,070 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:19,098 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:19,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265152525] [2019-10-13 21:05:19,099 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:19,099 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:19,099 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551296192] [2019-10-13 21:05:19,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:19,100 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:19,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:19,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:19,101 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand 3 states. [2019-10-13 21:05:19,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:19,121 INFO L93 Difference]: Finished difference Result 129 states and 205 transitions. [2019-10-13 21:05:19,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:19,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 21:05:19,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:19,123 INFO L225 Difference]: With dead ends: 129 [2019-10-13 21:05:19,123 INFO L226 Difference]: Without dead ends: 90 [2019-10-13 21:05:19,124 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:19,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-13 21:05:19,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-10-13 21:05:19,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-13 21:05:19,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2019-10-13 21:05:19,133 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 18 [2019-10-13 21:05:19,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:19,134 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2019-10-13 21:05:19,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:19,137 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2019-10-13 21:05:19,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:05:19,139 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:19,139 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:19,139 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:19,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:19,140 INFO L82 PathProgramCache]: Analyzing trace with hash 894112118, now seen corresponding path program 1 times [2019-10-13 21:05:19,140 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:19,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945530899] [2019-10-13 21:05:19,141 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,141 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:19,215 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:19,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945530899] [2019-10-13 21:05:19,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:19,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:19,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044403787] [2019-10-13 21:05:19,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:19,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:19,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:19,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:19,219 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand 3 states. [2019-10-13 21:05:19,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:19,244 INFO L93 Difference]: Finished difference Result 156 states and 248 transitions. [2019-10-13 21:05:19,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:19,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 21:05:19,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:19,246 INFO L225 Difference]: With dead ends: 156 [2019-10-13 21:05:19,247 INFO L226 Difference]: Without dead ends: 154 [2019-10-13 21:05:19,247 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:19,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-13 21:05:19,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2019-10-13 21:05:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-13 21:05:19,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2019-10-13 21:05:19,259 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 18 [2019-10-13 21:05:19,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:19,260 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2019-10-13 21:05:19,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:19,260 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2019-10-13 21:05:19,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:05:19,261 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:19,262 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:19,262 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:19,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:19,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170488, now seen corresponding path program 1 times [2019-10-13 21:05:19,263 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:19,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485751593] [2019-10-13 21:05:19,263 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,263 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:19,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:19,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485751593] [2019-10-13 21:05:19,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:19,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:19,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098834805] [2019-10-13 21:05:19,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:19,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:19,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:19,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:19,313 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand 3 states. [2019-10-13 21:05:19,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:19,347 INFO L93 Difference]: Finished difference Result 272 states and 424 transitions. [2019-10-13 21:05:19,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:19,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 21:05:19,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:19,349 INFO L225 Difference]: With dead ends: 272 [2019-10-13 21:05:19,350 INFO L226 Difference]: Without dead ends: 162 [2019-10-13 21:05:19,355 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:19,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-13 21:05:19,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-10-13 21:05:19,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-13 21:05:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2019-10-13 21:05:19,369 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 18 [2019-10-13 21:05:19,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:19,369 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2019-10-13 21:05:19,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:19,370 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2019-10-13 21:05:19,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:05:19,371 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:19,371 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:19,371 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:19,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:19,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1947887240, now seen corresponding path program 1 times [2019-10-13 21:05:19,372 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:19,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713684740] [2019-10-13 21:05:19,373 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,373 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:19,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:19,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713684740] [2019-10-13 21:05:19,415 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:19,415 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:19,416 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706106698] [2019-10-13 21:05:19,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:19,416 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:19,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:19,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:19,417 INFO L87 Difference]: Start difference. First operand 160 states and 242 transitions. Second operand 3 states. [2019-10-13 21:05:19,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:19,453 INFO L93 Difference]: Finished difference Result 240 states and 360 transitions. [2019-10-13 21:05:19,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:19,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 21:05:19,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:19,456 INFO L225 Difference]: With dead ends: 240 [2019-10-13 21:05:19,456 INFO L226 Difference]: Without dead ends: 166 [2019-10-13 21:05:19,457 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:19,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-13 21:05:19,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-10-13 21:05:19,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-13 21:05:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2019-10-13 21:05:19,471 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 19 [2019-10-13 21:05:19,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:19,472 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2019-10-13 21:05:19,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:19,472 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2019-10-13 21:05:19,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:05:19,473 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:19,474 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:19,474 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:19,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:19,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1554860230, now seen corresponding path program 1 times [2019-10-13 21:05:19,474 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:19,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500162584] [2019-10-13 21:05:19,475 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,475 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:19,513 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:19,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500162584] [2019-10-13 21:05:19,514 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:19,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:19,514 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953151992] [2019-10-13 21:05:19,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:19,515 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:19,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:19,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:19,517 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand 3 states. [2019-10-13 21:05:19,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:19,554 INFO L93 Difference]: Finished difference Result 284 states and 424 transitions. [2019-10-13 21:05:19,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:19,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 21:05:19,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:19,557 INFO L225 Difference]: With dead ends: 284 [2019-10-13 21:05:19,557 INFO L226 Difference]: Without dead ends: 282 [2019-10-13 21:05:19,558 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:19,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-10-13 21:05:19,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2019-10-13 21:05:19,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-13 21:05:19,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2019-10-13 21:05:19,574 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 19 [2019-10-13 21:05:19,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:19,574 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2019-10-13 21:05:19,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:19,575 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2019-10-13 21:05:19,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:05:19,579 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:19,579 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:19,580 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:19,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:19,580 INFO L82 PathProgramCache]: Analyzing trace with hash -2060048696, now seen corresponding path program 1 times [2019-10-13 21:05:19,580 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:19,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901133712] [2019-10-13 21:05:19,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:19,646 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:19,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901133712] [2019-10-13 21:05:19,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:19,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:19,647 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998545282] [2019-10-13 21:05:19,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:19,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:19,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:19,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:19,649 INFO L87 Difference]: Start difference. First operand 232 states and 334 transitions. Second operand 3 states. [2019-10-13 21:05:19,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:19,675 INFO L93 Difference]: Finished difference Result 524 states and 752 transitions. [2019-10-13 21:05:19,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:19,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 21:05:19,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:19,678 INFO L225 Difference]: With dead ends: 524 [2019-10-13 21:05:19,678 INFO L226 Difference]: Without dead ends: 306 [2019-10-13 21:05:19,679 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:19,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-13 21:05:19,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-10-13 21:05:19,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-13 21:05:19,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2019-10-13 21:05:19,692 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 19 [2019-10-13 21:05:19,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:19,692 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2019-10-13 21:05:19,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:19,692 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2019-10-13 21:05:19,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:05:19,693 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:19,694 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:19,694 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:19,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:19,694 INFO L82 PathProgramCache]: Analyzing trace with hash 956242573, now seen corresponding path program 1 times [2019-10-13 21:05:19,695 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:19,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482844331] [2019-10-13 21:05:19,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:19,717 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:19,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482844331] [2019-10-13 21:05:19,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:19,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:19,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914702222] [2019-10-13 21:05:19,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:19,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:19,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:19,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:19,720 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 3 states. [2019-10-13 21:05:19,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:19,737 INFO L93 Difference]: Finished difference Result 456 states and 628 transitions. [2019-10-13 21:05:19,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:19,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 21:05:19,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:19,740 INFO L225 Difference]: With dead ends: 456 [2019-10-13 21:05:19,740 INFO L226 Difference]: Without dead ends: 314 [2019-10-13 21:05:19,741 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:19,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-10-13 21:05:19,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2019-10-13 21:05:19,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-10-13 21:05:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 422 transitions. [2019-10-13 21:05:19,753 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 422 transitions. Word has length 20 [2019-10-13 21:05:19,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:19,754 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 422 transitions. [2019-10-13 21:05:19,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:19,754 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 422 transitions. [2019-10-13 21:05:19,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:05:19,755 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:19,755 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:19,755 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:19,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:19,756 INFO L82 PathProgramCache]: Analyzing trace with hash 563215563, now seen corresponding path program 1 times [2019-10-13 21:05:19,756 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:19,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295789976] [2019-10-13 21:05:19,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:19,776 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:19,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295789976] [2019-10-13 21:05:19,776 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:19,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:19,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420141082] [2019-10-13 21:05:19,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:19,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:19,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:19,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:19,778 INFO L87 Difference]: Start difference. First operand 312 states and 422 transitions. Second operand 3 states. [2019-10-13 21:05:19,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:19,802 INFO L93 Difference]: Finished difference Result 524 states and 712 transitions. [2019-10-13 21:05:19,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:19,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 21:05:19,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:19,805 INFO L225 Difference]: With dead ends: 524 [2019-10-13 21:05:19,805 INFO L226 Difference]: Without dead ends: 522 [2019-10-13 21:05:19,806 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:19,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-10-13 21:05:19,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2019-10-13 21:05:19,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-13 21:05:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2019-10-13 21:05:19,822 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 20 [2019-10-13 21:05:19,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:19,822 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2019-10-13 21:05:19,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2019-10-13 21:05:19,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:05:19,824 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:19,824 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:19,824 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:19,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:19,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1243273933, now seen corresponding path program 1 times [2019-10-13 21:05:19,825 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:19,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894014655] [2019-10-13 21:05:19,825 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,825 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:19,854 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:19,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894014655] [2019-10-13 21:05:19,855 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:19,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:19,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479789216] [2019-10-13 21:05:19,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:19,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:19,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:19,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:19,856 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 3 states. [2019-10-13 21:05:19,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:19,893 INFO L93 Difference]: Finished difference Result 1020 states and 1320 transitions. [2019-10-13 21:05:19,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:19,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 21:05:19,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:19,897 INFO L225 Difference]: With dead ends: 1020 [2019-10-13 21:05:19,897 INFO L226 Difference]: Without dead ends: 586 [2019-10-13 21:05:19,899 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:19,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-13 21:05:19,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-10-13 21:05:19,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-13 21:05:19,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 726 transitions. [2019-10-13 21:05:19,921 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 726 transitions. Word has length 20 [2019-10-13 21:05:19,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:19,921 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 726 transitions. [2019-10-13 21:05:19,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:19,921 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 726 transitions. [2019-10-13 21:05:19,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:05:19,924 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:19,924 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:19,924 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:19,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:19,925 INFO L82 PathProgramCache]: Analyzing trace with hash 280029309, now seen corresponding path program 1 times [2019-10-13 21:05:19,925 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:19,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53128987] [2019-10-13 21:05:19,925 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,926 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:19,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:19,968 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:19,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53128987] [2019-10-13 21:05:19,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:19,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:19,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629205499] [2019-10-13 21:05:19,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:19,972 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:19,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:19,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:19,973 INFO L87 Difference]: Start difference. First operand 584 states and 726 transitions. Second operand 3 states. [2019-10-13 21:05:20,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:20,001 INFO L93 Difference]: Finished difference Result 876 states and 1080 transitions. [2019-10-13 21:05:20,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:20,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 21:05:20,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:20,006 INFO L225 Difference]: With dead ends: 876 [2019-10-13 21:05:20,006 INFO L226 Difference]: Without dead ends: 602 [2019-10-13 21:05:20,010 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:20,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-13 21:05:20,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-10-13 21:05:20,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-13 21:05:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 726 transitions. [2019-10-13 21:05:20,034 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 726 transitions. Word has length 21 [2019-10-13 21:05:20,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:20,035 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 726 transitions. [2019-10-13 21:05:20,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:20,035 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 726 transitions. [2019-10-13 21:05:20,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:05:20,036 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:20,036 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:20,037 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:20,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:20,037 INFO L82 PathProgramCache]: Analyzing trace with hash -112997701, now seen corresponding path program 1 times [2019-10-13 21:05:20,037 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:20,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441386951] [2019-10-13 21:05:20,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:20,063 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:20,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441386951] [2019-10-13 21:05:20,064 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:20,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:20,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464197862] [2019-10-13 21:05:20,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:20,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:20,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:20,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:20,065 INFO L87 Difference]: Start difference. First operand 600 states and 726 transitions. Second operand 3 states. [2019-10-13 21:05:20,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:20,095 INFO L93 Difference]: Finished difference Result 970 states and 1159 transitions. [2019-10-13 21:05:20,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:20,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 21:05:20,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:20,100 INFO L225 Difference]: With dead ends: 970 [2019-10-13 21:05:20,100 INFO L226 Difference]: Without dead ends: 968 [2019-10-13 21:05:20,101 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:20,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-10-13 21:05:20,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 904. [2019-10-13 21:05:20,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-10-13 21:05:20,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1062 transitions. [2019-10-13 21:05:20,133 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1062 transitions. Word has length 21 [2019-10-13 21:05:20,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:20,135 INFO L462 AbstractCegarLoop]: Abstraction has 904 states and 1062 transitions. [2019-10-13 21:05:20,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:20,136 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1062 transitions. [2019-10-13 21:05:20,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:05:20,138 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:20,138 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:20,138 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:20,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:20,139 INFO L82 PathProgramCache]: Analyzing trace with hash 567060669, now seen corresponding path program 1 times [2019-10-13 21:05:20,139 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:20,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511935935] [2019-10-13 21:05:20,140 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,140 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:20,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:20,162 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:20,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511935935] [2019-10-13 21:05:20,163 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:20,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:20,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589091933] [2019-10-13 21:05:20,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:20,164 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:20,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:20,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:20,164 INFO L87 Difference]: Start difference. First operand 904 states and 1062 transitions. Second operand 3 states. [2019-10-13 21:05:20,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:20,204 INFO L93 Difference]: Finished difference Result 1992 states and 2278 transitions. [2019-10-13 21:05:20,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:20,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 21:05:20,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:20,206 INFO L225 Difference]: With dead ends: 1992 [2019-10-13 21:05:20,206 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:05:20,210 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:20,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:05:20,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:05:20,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:05:20,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:05:20,211 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-10-13 21:05:20,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:20,212 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:05:20,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:20,212 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:05:20,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:05:20,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:05:20,234 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-13 21:05:20,234 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:05:20,234 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:05:20,234 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 21:05:20,234 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:05:20,235 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:05:20,235 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-10-13 21:05:20,235 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 107) no Hoare annotation was computed. [2019-10-13 21:05:20,235 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2019-10-13 21:05:20,235 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-10-13 21:05:20,235 INFO L446 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2019-10-13 21:05:20,235 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2019-10-13 21:05:20,235 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2019-10-13 21:05:20,235 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2019-10-13 21:05:20,236 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2019-10-13 21:05:20,236 INFO L443 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-10-13 21:05:20,236 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 107) no Hoare annotation was computed. [2019-10-13 21:05:20,236 INFO L443 ceAbstractionStarter]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2019-10-13 21:05:20,236 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2019-10-13 21:05:20,236 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-10-13 21:05:20,237 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-10-13 21:05:20,237 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2019-10-13 21:05:20,237 INFO L446 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2019-10-13 21:05:20,237 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-13 21:05:20,237 INFO L443 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-10-13 21:05:20,237 INFO L439 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2019-10-13 21:05:20,238 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2019-10-13 21:05:20,238 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2019-10-13 21:05:20,238 INFO L443 ceAbstractionStarter]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2019-10-13 21:05:20,238 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-10-13 21:05:20,238 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2019-10-13 21:05:20,238 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2019-10-13 21:05:20,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:05:20 BoogieIcfgContainer [2019-10-13 21:05:20,246 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 21:05:20,250 INFO L168 Benchmark]: Toolchain (without parser) took 2788.92 ms. Allocated memory was 145.8 MB in the beginning and 234.4 MB in the end (delta: 88.6 MB). Free memory was 104.0 MB in the beginning and 87.8 MB in the end (delta: 16.2 MB). Peak memory consumption was 104.8 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:20,250 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 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:20,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.49 ms. Allocated memory is still 145.8 MB. Free memory was 103.6 MB in the beginning and 93.2 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:20,252 INFO L168 Benchmark]: Boogie Preprocessor took 139.61 ms. Allocated memory was 145.8 MB in the beginning and 204.5 MB in the end (delta: 58.7 MB). Free memory was 93.2 MB in the beginning and 182.4 MB in the end (delta: -89.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:20,253 INFO L168 Benchmark]: RCFGBuilder took 316.23 ms. Allocated memory is still 204.5 MB. Free memory was 182.4 MB in the beginning and 167.4 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:20,254 INFO L168 Benchmark]: TraceAbstraction took 2049.27 ms. Allocated memory was 204.5 MB in the beginning and 234.4 MB in the end (delta: 29.9 MB). Free memory was 166.8 MB in the beginning and 87.8 MB in the end (delta: 79.0 MB). Peak memory consumption was 108.8 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:20,258 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 279.49 ms. Allocated memory is still 145.8 MB. Free memory was 103.6 MB in the beginning and 93.2 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 139.61 ms. Allocated memory was 145.8 MB in the beginning and 204.5 MB in the end (delta: 58.7 MB). Free memory was 93.2 MB in the beginning and 182.4 MB in the end (delta: -89.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 316.23 ms. Allocated memory is still 204.5 MB. Free memory was 182.4 MB in the beginning and 167.4 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2049.27 ms. Allocated memory was 204.5 MB in the beginning and 234.4 MB in the end (delta: 29.9 MB). Free memory was 166.8 MB in the beginning and 87.8 MB in the end (delta: 79.0 MB). Peak memory consumption was 108.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Result: SAFE, OverallTime: 1.9s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 923 SDtfs, 417 SDslu, 612 SDs, 0 SdLazy, 91 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 74 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, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 9690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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...