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-13a467a-m [2019-10-15 01:04:17,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:04:17,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:04:17,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:04:17,410 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:04:17,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:04:17,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:04:17,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:04:17,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:04:17,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:04:17,426 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:04:17,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:04:17,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:04:17,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:04:17,431 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:04:17,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:04:17,434 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:04:17,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:04:17,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:04:17,445 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:04:17,448 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:04:17,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:04:17,452 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:04:17,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:04:17,457 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:04:17,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:04:17,458 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:04:17,460 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:04:17,461 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:04:17,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:04:17,463 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:04:17,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:04:17,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:04:17,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:04:17,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:04:17,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:04:17,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:04:17,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:04:17,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:04:17,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:04:17,473 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:04:17,474 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:04:17,509 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:04:17,509 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:04:17,512 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:04:17,513 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:04:17,513 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:04:17,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:04:17,513 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:04:17,513 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:04:17,514 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:04:17,514 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:04:17,514 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:04:17,515 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:04:17,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:04:17,516 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:04:17,516 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:04:17,516 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:04:17,516 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:04:17,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:04:17,517 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:04:17,518 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:04:17,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:04:17,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:04:17,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:04:17,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:04:17,519 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:04:17,519 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:04:17,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:04:17,520 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:04:17,520 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:04:17,814 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:04:17,827 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:04:17,831 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:04:17,833 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:04:17,833 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:04:17,834 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-15 01:04:17,916 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caa3cc280/40b35fc174f4469cba5ca4bff3528ab2/FLAGcf5fb87a3 [2019-10-15 01:04:18,424 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:04:18,425 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2019-10-15 01:04:18,436 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caa3cc280/40b35fc174f4469cba5ca4bff3528ab2/FLAGcf5fb87a3 [2019-10-15 01:04:18,791 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caa3cc280/40b35fc174f4469cba5ca4bff3528ab2 [2019-10-15 01:04:18,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:04:18,803 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:04:18,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:04:18,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:04:18,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:04:18,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:04:18" (1/1) ... [2019-10-15 01:04:18,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fffc6ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:18, skipping insertion in model container [2019-10-15 01:04:18,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:04:18" (1/1) ... [2019-10-15 01:04:18,820 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:04:18,838 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:04:19,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:04:19,022 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:04:19,045 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:04:19,057 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:04:19,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:19 WrapperNode [2019-10-15 01:04:19,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:04:19,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:04:19,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:04:19,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:04:19,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:19" (1/1) ... [2019-10-15 01:04:19,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:19" (1/1) ... [2019-10-15 01:04:19,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:19" (1/1) ... [2019-10-15 01:04:19,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:19" (1/1) ... [2019-10-15 01:04:19,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:19" (1/1) ... [2019-10-15 01:04:19,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:19" (1/1) ... [2019-10-15 01:04:19,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:19" (1/1) ... [2019-10-15 01:04:19,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:04:19,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:04:19,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:04:19,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:04:19,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:04:19,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:04:19,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:04:19,237 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:04:19,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:04:19,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:04:19,237 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:04:19,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:04:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:04:19,492 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:04:19,492 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:04:19,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:04:19 BoogieIcfgContainer [2019-10-15 01:04:19,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:04:19,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:04:19,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:04:19,500 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:04:19,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:04:18" (1/3) ... [2019-10-15 01:04:19,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12fef85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:04:19, skipping insertion in model container [2019-10-15 01:04:19,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:19" (2/3) ... [2019-10-15 01:04:19,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12fef85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:04:19, skipping insertion in model container [2019-10-15 01:04:19,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:04:19" (3/3) ... [2019-10-15 01:04:19,511 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2019-10-15 01:04:19,522 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:04:19,530 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:04:19,542 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:04:19,578 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:04:19,578 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:04:19,578 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:04:19,578 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:04:19,579 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:04:19,579 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:04:19,579 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:04:19,579 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:04:19,596 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-10-15 01:04:19,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 01:04:19,601 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:19,602 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:19,603 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:19,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:19,608 INFO L82 PathProgramCache]: Analyzing trace with hash 429652513, now seen corresponding path program 1 times [2019-10-15 01:04:19,618 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:19,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497224331] [2019-10-15 01:04:19,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:19,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:19,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:19,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:19,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497224331] [2019-10-15 01:04:19,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:19,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:19,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56371834] [2019-10-15 01:04:19,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:19,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:19,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:19,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:19,812 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2019-10-15 01:04:19,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:19,898 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2019-10-15 01:04:19,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:19,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-15 01:04:19,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:19,916 INFO L225 Difference]: With dead ends: 63 [2019-10-15 01:04:19,916 INFO L226 Difference]: Without dead ends: 48 [2019-10-15 01:04:19,922 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:19,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-15 01:04:19,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-10-15 01:04:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-15 01:04:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2019-10-15 01:04:19,992 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 16 [2019-10-15 01:04:19,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:19,992 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2019-10-15 01:04:19,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:19,994 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2019-10-15 01:04:19,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 01:04:19,996 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:19,997 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:19,997 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:19,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:19,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1109710883, now seen corresponding path program 1 times [2019-10-15 01:04:19,998 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:19,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769514047] [2019-10-15 01:04:19,999 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:19,999 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:19,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:20,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769514047] [2019-10-15 01:04:20,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:20,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:20,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882546237] [2019-10-15 01:04:20,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:20,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:20,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:20,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,066 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2019-10-15 01:04:20,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:20,108 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2019-10-15 01:04:20,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:20,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-15 01:04:20,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:20,112 INFO L225 Difference]: With dead ends: 77 [2019-10-15 01:04:20,112 INFO L226 Difference]: Without dead ends: 48 [2019-10-15 01:04:20,114 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-15 01:04:20,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-10-15 01:04:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-15 01:04:20,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2019-10-15 01:04:20,124 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 16 [2019-10-15 01:04:20,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:20,124 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2019-10-15 01:04:20,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:20,125 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2019-10-15 01:04:20,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 01:04:20,126 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:20,126 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:20,126 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:20,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:20,127 INFO L82 PathProgramCache]: Analyzing trace with hash 434540691, now seen corresponding path program 1 times [2019-10-15 01:04:20,127 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:20,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087582144] [2019-10-15 01:04:20,127 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,128 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:20,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:20,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087582144] [2019-10-15 01:04:20,184 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:20,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:20,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701242784] [2019-10-15 01:04:20,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:20,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:20,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:20,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,186 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2019-10-15 01:04:20,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:20,210 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2019-10-15 01:04:20,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:20,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-15 01:04:20,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:20,212 INFO L225 Difference]: With dead ends: 72 [2019-10-15 01:04:20,212 INFO L226 Difference]: Without dead ends: 51 [2019-10-15 01:04:20,213 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-15 01:04:20,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-10-15 01:04:20,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-15 01:04:20,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2019-10-15 01:04:20,227 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 17 [2019-10-15 01:04:20,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:20,227 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2019-10-15 01:04:20,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:20,228 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2019-10-15 01:04:20,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 01:04:20,229 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:20,229 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:20,229 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:20,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:20,230 INFO L82 PathProgramCache]: Analyzing trace with hash 41513681, now seen corresponding path program 1 times [2019-10-15 01:04:20,230 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:20,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822764969] [2019-10-15 01:04:20,230 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,231 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:20,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:20,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822764969] [2019-10-15 01:04:20,265 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:20,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:20,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145898845] [2019-10-15 01:04:20,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:20,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:20,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:20,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,267 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 3 states. [2019-10-15 01:04:20,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:20,297 INFO L93 Difference]: Finished difference Result 88 states and 144 transitions. [2019-10-15 01:04:20,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:20,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-15 01:04:20,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:20,299 INFO L225 Difference]: With dead ends: 88 [2019-10-15 01:04:20,299 INFO L226 Difference]: Without dead ends: 86 [2019-10-15 01:04:20,300 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-15 01:04:20,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2019-10-15 01:04:20,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-15 01:04:20,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2019-10-15 01:04:20,312 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 17 [2019-10-15 01:04:20,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:20,313 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2019-10-15 01:04:20,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:20,313 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2019-10-15 01:04:20,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 01:04:20,314 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:20,314 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:20,314 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:20,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:20,315 INFO L82 PathProgramCache]: Analyzing trace with hash 721572051, now seen corresponding path program 1 times [2019-10-15 01:04:20,315 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:20,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563384118] [2019-10-15 01:04:20,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:20,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563384118] [2019-10-15 01:04:20,378 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:20,378 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:20,378 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659703413] [2019-10-15 01:04:20,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:20,379 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:20,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:20,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,379 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 3 states. [2019-10-15 01:04:20,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:20,406 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2019-10-15 01:04:20,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:20,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-15 01:04:20,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:20,408 INFO L225 Difference]: With dead ends: 144 [2019-10-15 01:04:20,408 INFO L226 Difference]: Without dead ends: 88 [2019-10-15 01:04:20,409 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-15 01:04:20,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-10-15 01:04:20,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-15 01:04:20,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2019-10-15 01:04:20,418 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 17 [2019-10-15 01:04:20,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:20,419 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2019-10-15 01:04:20,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:20,419 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2019-10-15 01:04:20,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 01:04:20,420 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:20,420 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:20,421 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:20,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:20,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1287139128, now seen corresponding path program 1 times [2019-10-15 01:04:20,421 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:20,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091799969] [2019-10-15 01:04:20,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:20,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091799969] [2019-10-15 01:04:20,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:20,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:20,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22881881] [2019-10-15 01:04:20,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:20,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:20,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:20,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,463 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand 3 states. [2019-10-15 01:04:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:20,478 INFO L93 Difference]: Finished difference Result 129 states and 205 transitions. [2019-10-15 01:04:20,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:20,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-15 01:04:20,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:20,479 INFO L225 Difference]: With dead ends: 129 [2019-10-15 01:04:20,480 INFO L226 Difference]: Without dead ends: 90 [2019-10-15 01:04:20,480 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-15 01:04:20,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-10-15 01:04:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-15 01:04:20,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2019-10-15 01:04:20,489 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 18 [2019-10-15 01:04:20,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:20,489 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2019-10-15 01:04:20,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:20,489 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2019-10-15 01:04:20,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 01:04:20,490 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:20,491 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:20,491 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:20,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:20,491 INFO L82 PathProgramCache]: Analyzing trace with hash 894112118, now seen corresponding path program 1 times [2019-10-15 01:04:20,492 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:20,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408340861] [2019-10-15 01:04:20,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:20,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:20,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408340861] [2019-10-15 01:04:20,520 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:20,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:20,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383209365] [2019-10-15 01:04:20,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:20,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:20,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:20,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,522 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand 3 states. [2019-10-15 01:04:20,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:20,544 INFO L93 Difference]: Finished difference Result 156 states and 248 transitions. [2019-10-15 01:04:20,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:20,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-15 01:04:20,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:20,546 INFO L225 Difference]: With dead ends: 156 [2019-10-15 01:04:20,547 INFO L226 Difference]: Without dead ends: 154 [2019-10-15 01:04:20,547 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-15 01:04:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2019-10-15 01:04:20,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-15 01:04:20,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2019-10-15 01:04:20,560 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 18 [2019-10-15 01:04:20,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:20,561 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2019-10-15 01:04:20,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:20,561 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2019-10-15 01:04:20,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 01:04:20,563 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:20,563 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:20,563 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:20,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:20,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170488, now seen corresponding path program 1 times [2019-10-15 01:04:20,564 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:20,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515068648] [2019-10-15 01:04:20,564 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:20,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515068648] [2019-10-15 01:04:20,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:20,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:20,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410032713] [2019-10-15 01:04:20,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:20,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:20,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:20,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,590 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand 3 states. [2019-10-15 01:04:20,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:20,627 INFO L93 Difference]: Finished difference Result 272 states and 424 transitions. [2019-10-15 01:04:20,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:20,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-15 01:04:20,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:20,630 INFO L225 Difference]: With dead ends: 272 [2019-10-15 01:04:20,630 INFO L226 Difference]: Without dead ends: 162 [2019-10-15 01:04:20,631 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-15 01:04:20,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-10-15 01:04:20,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-15 01:04:20,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2019-10-15 01:04:20,659 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 18 [2019-10-15 01:04:20,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:20,659 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2019-10-15 01:04:20,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:20,659 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2019-10-15 01:04:20,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:04:20,661 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:20,664 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:20,665 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:20,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:20,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1947887240, now seen corresponding path program 1 times [2019-10-15 01:04:20,670 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:20,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068588244] [2019-10-15 01:04:20,670 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,671 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:20,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:20,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068588244] [2019-10-15 01:04:20,703 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:20,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:20,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044632594] [2019-10-15 01:04:20,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:20,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:20,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:20,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,706 INFO L87 Difference]: Start difference. First operand 160 states and 242 transitions. Second operand 3 states. [2019-10-15 01:04:20,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:20,748 INFO L93 Difference]: Finished difference Result 240 states and 360 transitions. [2019-10-15 01:04:20,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:20,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-15 01:04:20,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:20,750 INFO L225 Difference]: With dead ends: 240 [2019-10-15 01:04:20,750 INFO L226 Difference]: Without dead ends: 166 [2019-10-15 01:04:20,751 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-15 01:04:20,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-10-15 01:04:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-15 01:04:20,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2019-10-15 01:04:20,761 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 19 [2019-10-15 01:04:20,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:20,762 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2019-10-15 01:04:20,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2019-10-15 01:04:20,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:04:20,764 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:20,764 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:20,764 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:20,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:20,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1554860230, now seen corresponding path program 1 times [2019-10-15 01:04:20,765 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:20,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263607070] [2019-10-15 01:04:20,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:20,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:20,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263607070] [2019-10-15 01:04:20,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:20,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:20,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266055087] [2019-10-15 01:04:20,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:20,795 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:20,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:20,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,796 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand 3 states. [2019-10-15 01:04:20,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:20,826 INFO L93 Difference]: Finished difference Result 284 states and 424 transitions. [2019-10-15 01:04:20,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:20,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-15 01:04:20,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:20,830 INFO L225 Difference]: With dead ends: 284 [2019-10-15 01:04:20,830 INFO L226 Difference]: Without dead ends: 282 [2019-10-15 01:04:20,831 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-10-15 01:04:20,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2019-10-15 01:04:20,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-15 01:04:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2019-10-15 01:04:20,848 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 19 [2019-10-15 01:04:20,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:20,848 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2019-10-15 01:04:20,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:20,848 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2019-10-15 01:04:20,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:04:20,850 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:20,850 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:20,851 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:20,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:20,851 INFO L82 PathProgramCache]: Analyzing trace with hash -2060048696, now seen corresponding path program 1 times [2019-10-15 01:04:20,851 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:20,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447104578] [2019-10-15 01:04:20,852 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,852 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:20,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:20,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447104578] [2019-10-15 01:04:20,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:20,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:20,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224507330] [2019-10-15 01:04:20,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:20,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:20,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:20,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,889 INFO L87 Difference]: Start difference. First operand 232 states and 334 transitions. Second operand 3 states. [2019-10-15 01:04:20,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:20,910 INFO L93 Difference]: Finished difference Result 524 states and 752 transitions. [2019-10-15 01:04:20,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:20,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-15 01:04:20,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:20,913 INFO L225 Difference]: With dead ends: 524 [2019-10-15 01:04:20,913 INFO L226 Difference]: Without dead ends: 306 [2019-10-15 01:04:20,915 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-15 01:04:20,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-10-15 01:04:20,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-15 01:04:20,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2019-10-15 01:04:20,939 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 19 [2019-10-15 01:04:20,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:20,940 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2019-10-15 01:04:20,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:20,940 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2019-10-15 01:04:20,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:04:20,943 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:20,943 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-15 01:04:20,944 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:20,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:20,944 INFO L82 PathProgramCache]: Analyzing trace with hash 956242573, now seen corresponding path program 1 times [2019-10-15 01:04:20,944 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:20,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146504258] [2019-10-15 01:04:20,945 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,945 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:20,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:20,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146504258] [2019-10-15 01:04:20,989 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:20,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:20,991 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499401731] [2019-10-15 01:04:20,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:20,992 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:20,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:20,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:20,992 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 3 states. [2019-10-15 01:04:21,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:21,019 INFO L93 Difference]: Finished difference Result 456 states and 628 transitions. [2019-10-15 01:04:21,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:21,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-15 01:04:21,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:21,022 INFO L225 Difference]: With dead ends: 456 [2019-10-15 01:04:21,022 INFO L226 Difference]: Without dead ends: 314 [2019-10-15 01:04:21,025 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:21,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-10-15 01:04:21,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2019-10-15 01:04:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-10-15 01:04:21,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 422 transitions. [2019-10-15 01:04:21,045 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 422 transitions. Word has length 20 [2019-10-15 01:04:21,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:21,045 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 422 transitions. [2019-10-15 01:04:21,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 422 transitions. [2019-10-15 01:04:21,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:04:21,047 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:21,047 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-15 01:04:21,048 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:21,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:21,049 INFO L82 PathProgramCache]: Analyzing trace with hash 563215563, now seen corresponding path program 1 times [2019-10-15 01:04:21,049 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:21,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392723464] [2019-10-15 01:04:21,051 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:21,051 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:21,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:21,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-15 01:04:21,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392723464] [2019-10-15 01:04:21,099 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:21,099 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:21,099 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33834660] [2019-10-15 01:04:21,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:21,100 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:21,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:21,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:21,101 INFO L87 Difference]: Start difference. First operand 312 states and 422 transitions. Second operand 3 states. [2019-10-15 01:04:21,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:21,129 INFO L93 Difference]: Finished difference Result 524 states and 712 transitions. [2019-10-15 01:04:21,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:21,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-15 01:04:21,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:21,137 INFO L225 Difference]: With dead ends: 524 [2019-10-15 01:04:21,137 INFO L226 Difference]: Without dead ends: 522 [2019-10-15 01:04:21,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:21,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-10-15 01:04:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2019-10-15 01:04:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-15 01:04:21,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2019-10-15 01:04:21,156 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 20 [2019-10-15 01:04:21,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:21,156 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2019-10-15 01:04:21,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:21,156 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2019-10-15 01:04:21,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:04:21,160 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:21,160 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-15 01:04:21,161 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:21,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:21,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1243273933, now seen corresponding path program 1 times [2019-10-15 01:04:21,161 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:21,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393635213] [2019-10-15 01:04:21,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:21,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:21,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:21,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393635213] [2019-10-15 01:04:21,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:21,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:21,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034498360] [2019-10-15 01:04:21,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:21,199 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:21,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:21,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:21,200 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 3 states. [2019-10-15 01:04:21,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:21,228 INFO L93 Difference]: Finished difference Result 1020 states and 1320 transitions. [2019-10-15 01:04:21,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:21,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-15 01:04:21,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:21,232 INFO L225 Difference]: With dead ends: 1020 [2019-10-15 01:04:21,232 INFO L226 Difference]: Without dead ends: 586 [2019-10-15 01:04:21,234 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:21,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-15 01:04:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-10-15 01:04:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-15 01:04:21,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 726 transitions. [2019-10-15 01:04:21,255 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 726 transitions. Word has length 20 [2019-10-15 01:04:21,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:21,255 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 726 transitions. [2019-10-15 01:04:21,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:21,256 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 726 transitions. [2019-10-15 01:04:21,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:04:21,258 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:21,258 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-15 01:04:21,259 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:21,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:21,259 INFO L82 PathProgramCache]: Analyzing trace with hash 280029309, now seen corresponding path program 1 times [2019-10-15 01:04:21,259 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:21,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511712256] [2019-10-15 01:04:21,260 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:21,260 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:21,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:21,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:21,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511712256] [2019-10-15 01:04:21,283 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:21,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:21,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683597575] [2019-10-15 01:04:21,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:21,284 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:21,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:21,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:21,285 INFO L87 Difference]: Start difference. First operand 584 states and 726 transitions. Second operand 3 states. [2019-10-15 01:04:21,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:21,311 INFO L93 Difference]: Finished difference Result 876 states and 1080 transitions. [2019-10-15 01:04:21,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:21,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 01:04:21,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:21,314 INFO L225 Difference]: With dead ends: 876 [2019-10-15 01:04:21,314 INFO L226 Difference]: Without dead ends: 602 [2019-10-15 01:04:21,315 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:21,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-15 01:04:21,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-10-15 01:04:21,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-15 01:04:21,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 726 transitions. [2019-10-15 01:04:21,337 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 726 transitions. Word has length 21 [2019-10-15 01:04:21,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:21,337 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 726 transitions. [2019-10-15 01:04:21,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:21,337 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 726 transitions. [2019-10-15 01:04:21,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:04:21,338 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:21,339 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-15 01:04:21,339 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:21,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:21,339 INFO L82 PathProgramCache]: Analyzing trace with hash -112997701, now seen corresponding path program 1 times [2019-10-15 01:04:21,340 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:21,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353526801] [2019-10-15 01:04:21,340 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:21,340 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:21,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:21,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:21,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353526801] [2019-10-15 01:04:21,358 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:21,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:21,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6534571] [2019-10-15 01:04:21,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:21,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:21,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:21,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:21,360 INFO L87 Difference]: Start difference. First operand 600 states and 726 transitions. Second operand 3 states. [2019-10-15 01:04:21,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:21,388 INFO L93 Difference]: Finished difference Result 970 states and 1159 transitions. [2019-10-15 01:04:21,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:21,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 01:04:21,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:21,393 INFO L225 Difference]: With dead ends: 970 [2019-10-15 01:04:21,393 INFO L226 Difference]: Without dead ends: 968 [2019-10-15 01:04:21,394 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:21,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-10-15 01:04:21,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 904. [2019-10-15 01:04:21,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-10-15 01:04:21,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1062 transitions. [2019-10-15 01:04:21,424 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1062 transitions. Word has length 21 [2019-10-15 01:04:21,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:21,425 INFO L462 AbstractCegarLoop]: Abstraction has 904 states and 1062 transitions. [2019-10-15 01:04:21,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1062 transitions. [2019-10-15 01:04:21,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:04:21,427 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:21,428 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-15 01:04:21,428 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:21,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:21,428 INFO L82 PathProgramCache]: Analyzing trace with hash 567060669, now seen corresponding path program 1 times [2019-10-15 01:04:21,429 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:21,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929096462] [2019-10-15 01:04:21,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:21,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:21,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:21,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:21,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929096462] [2019-10-15 01:04:21,447 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:21,448 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:21,448 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870099106] [2019-10-15 01:04:21,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:21,448 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:21,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:21,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:21,449 INFO L87 Difference]: Start difference. First operand 904 states and 1062 transitions. Second operand 3 states. [2019-10-15 01:04:21,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:21,491 INFO L93 Difference]: Finished difference Result 1992 states and 2278 transitions. [2019-10-15 01:04:21,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:21,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 01:04:21,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:21,492 INFO L225 Difference]: With dead ends: 1992 [2019-10-15 01:04:21,492 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:04:21,496 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:21,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:04:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:04:21,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:04:21,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:04:21,497 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-10-15 01:04:21,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:21,497 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:04:21,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:21,498 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:04:21,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:04:21,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:04:21,521 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 01:04:21,522 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:04:21,522 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:04:21,522 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 01:04:21,522 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:04:21,522 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:04:21,523 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-10-15 01:04:21,523 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 107) no Hoare annotation was computed. [2019-10-15 01:04:21,523 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2019-10-15 01:04:21,523 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-10-15 01:04:21,523 INFO L446 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2019-10-15 01:04:21,523 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2019-10-15 01:04:21,524 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2019-10-15 01:04:21,524 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2019-10-15 01:04:21,524 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2019-10-15 01:04:21,524 INFO L443 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-10-15 01:04:21,524 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 107) no Hoare annotation was computed. [2019-10-15 01:04:21,524 INFO L443 ceAbstractionStarter]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2019-10-15 01:04:21,525 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-10-15 01:04:21,525 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2019-10-15 01:04:21,525 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-10-15 01:04:21,525 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2019-10-15 01:04:21,525 INFO L446 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2019-10-15 01:04:21,526 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-15 01:04:21,526 INFO L443 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-10-15 01:04:21,526 INFO L439 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2019-10-15 01:04:21,526 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2019-10-15 01:04:21,526 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2019-10-15 01:04:21,526 INFO L443 ceAbstractionStarter]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2019-10-15 01:04:21,527 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-10-15 01:04:21,527 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2019-10-15 01:04:21,527 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2019-10-15 01:04:21,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:04:21 BoogieIcfgContainer [2019-10-15 01:04:21,536 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:04:21,538 INFO L168 Benchmark]: Toolchain (without parser) took 2735.60 ms. Allocated memory was 143.7 MB in the beginning and 234.4 MB in the end (delta: 90.7 MB). Free memory was 101.3 MB in the beginning and 89.1 MB in the end (delta: 12.2 MB). Peak memory consumption was 102.9 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:21,539 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 143.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 01:04:21,540 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.64 ms. Allocated memory is still 143.7 MB. Free memory was 101.1 MB in the beginning and 91.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:21,541 INFO L168 Benchmark]: Boogie Preprocessor took 117.12 ms. Allocated memory was 143.7 MB in the beginning and 201.9 MB in the end (delta: 58.2 MB). Free memory was 91.0 MB in the beginning and 179.6 MB in the end (delta: -88.6 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:21,542 INFO L168 Benchmark]: RCFGBuilder took 318.86 ms. Allocated memory is still 201.9 MB. Free memory was 179.6 MB in the beginning and 164.8 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:21,543 INFO L168 Benchmark]: TraceAbstraction took 2039.76 ms. Allocated memory was 201.9 MB in the beginning and 234.4 MB in the end (delta: 32.5 MB). Free memory was 164.1 MB in the beginning and 89.1 MB in the end (delta: 75.0 MB). Peak memory consumption was 107.5 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:21,553 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 143.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 253.64 ms. Allocated memory is still 143.7 MB. Free memory was 101.1 MB in the beginning and 91.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.12 ms. Allocated memory was 143.7 MB in the beginning and 201.9 MB in the end (delta: 58.2 MB). Free memory was 91.0 MB in the beginning and 179.6 MB in the end (delta: -88.6 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 318.86 ms. Allocated memory is still 201.9 MB. Free memory was 179.6 MB in the beginning and 164.8 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2039.76 ms. Allocated memory was 201.9 MB in the beginning and 234.4 MB in the end (delta: 32.5 MB). Free memory was 164.1 MB in the beginning and 89.1 MB in the end (delta: 75.0 MB). Peak memory consumption was 107.5 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...