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/eca-rers2012/Problem11_label35.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 20:04:47,999 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 20:04:48,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 20:04:48,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 20:04:48,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 20:04:48,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 20:04:48,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 20:04:48,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 20:04:48,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 20:04:48,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 20:04:48,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 20:04:48,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 20:04:48,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 20:04:48,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 20:04:48,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 20:04:48,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 20:04:48,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 20:04:48,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 20:04:48,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 20:04:48,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 20:04:48,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 20:04:48,036 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 20:04:48,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 20:04:48,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 20:04:48,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 20:04:48,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 20:04:48,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 20:04:48,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 20:04:48,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 20:04:48,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 20:04:48,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 20:04:48,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 20:04:48,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 20:04:48,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 20:04:48,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 20:04:48,047 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 20:04:48,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 20:04:48,048 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 20:04:48,048 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 20:04:48,049 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 20:04:48,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 20:04:48,050 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 20:04:48,070 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 20:04:48,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 20:04:48,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 20:04:48,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 20:04:48,073 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 20:04:48,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 20:04:48,073 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 20:04:48,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 20:04:48,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 20:04:48,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 20:04:48,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 20:04:48,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 20:04:48,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 20:04:48,075 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 20:04:48,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 20:04:48,075 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 20:04:48,075 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 20:04:48,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 20:04:48,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 20:04:48,076 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 20:04:48,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 20:04:48,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:04:48,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 20:04:48,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 20:04:48,077 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 20:04:48,077 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 20:04:48,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 20:04:48,078 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 20:04:48,078 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 20:04:48,356 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 20:04:48,369 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 20:04:48,373 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 20:04:48,374 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 20:04:48,375 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 20:04:48,375 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label35.c [2019-10-13 20:04:48,448 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/175ea9fa2/565175732e1149dc984e154e6498f312/FLAG6920db17a [2019-10-13 20:04:49,034 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 20:04:49,037 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label35.c [2019-10-13 20:04:49,068 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/175ea9fa2/565175732e1149dc984e154e6498f312/FLAG6920db17a [2019-10-13 20:04:49,283 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/175ea9fa2/565175732e1149dc984e154e6498f312 [2019-10-13 20:04:49,294 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 20:04:49,296 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 20:04:49,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 20:04:49,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 20:04:49,302 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 20:04:49,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:04:49" (1/1) ... [2019-10-13 20:04:49,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac730e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:49, skipping insertion in model container [2019-10-13 20:04:49,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:04:49" (1/1) ... [2019-10-13 20:04:49,312 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 20:04:49,373 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 20:04:49,999 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:04:50,010 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 20:04:50,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:04:50,299 INFO L192 MainTranslator]: Completed translation [2019-10-13 20:04:50,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:50 WrapperNode [2019-10-13 20:04:50,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 20:04:50,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 20:04:50,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 20:04:50,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 20:04:50,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:50" (1/1) ... [2019-10-13 20:04:50,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:50" (1/1) ... [2019-10-13 20:04:50,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:50" (1/1) ... [2019-10-13 20:04:50,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:50" (1/1) ... [2019-10-13 20:04:50,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:50" (1/1) ... [2019-10-13 20:04:50,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:50" (1/1) ... [2019-10-13 20:04:50,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:50" (1/1) ... [2019-10-13 20:04:50,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 20:04:50,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 20:04:50,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 20:04:50,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 20:04:50,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:04:50,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 20:04:50,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 20:04:50,583 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 20:04:50,583 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 20:04:50,583 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 20:04:50,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 20:04:50,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 20:04:50,585 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 20:04:50,586 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 20:04:50,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 20:04:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 20:04:52,447 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 20:04:52,450 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 20:04:52,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:04:52 BoogieIcfgContainer [2019-10-13 20:04:52,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 20:04:52,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 20:04:52,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 20:04:52,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 20:04:52,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:04:49" (1/3) ... [2019-10-13 20:04:52,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493a5071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:04:52, skipping insertion in model container [2019-10-13 20:04:52,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:50" (2/3) ... [2019-10-13 20:04:52,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493a5071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:04:52, skipping insertion in model container [2019-10-13 20:04:52,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:04:52" (3/3) ... [2019-10-13 20:04:52,461 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label35.c [2019-10-13 20:04:52,471 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 20:04:52,480 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 20:04:52,492 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 20:04:52,552 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 20:04:52,552 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 20:04:52,553 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 20:04:52,553 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 20:04:52,553 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 20:04:52,553 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 20:04:52,554 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 20:04:52,554 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 20:04:52,601 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2019-10-13 20:04:52,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-13 20:04:52,614 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:04:52,616 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:04:52,618 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:04:52,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:04:52,624 INFO L82 PathProgramCache]: Analyzing trace with hash 524759243, now seen corresponding path program 1 times [2019-10-13 20:04:52,635 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:04:52,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409999112] [2019-10-13 20:04:52,636 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:04:52,636 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:04:52,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:04:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:04:53,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:04:53,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409999112] [2019-10-13 20:04:53,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:04:53,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 20:04:53,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271706842] [2019-10-13 20:04:53,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 20:04:53,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:04:53,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 20:04:53,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 20:04:53,149 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 4 states. [2019-10-13 20:04:55,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:04:55,370 INFO L93 Difference]: Finished difference Result 994 states and 1776 transitions. [2019-10-13 20:04:55,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 20:04:55,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-10-13 20:04:55,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:04:55,395 INFO L225 Difference]: With dead ends: 994 [2019-10-13 20:04:55,395 INFO L226 Difference]: Without dead ends: 620 [2019-10-13 20:04:55,405 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 20:04:55,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-13 20:04:55,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 614. [2019-10-13 20:04:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-13 20:04:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 908 transitions. [2019-10-13 20:04:55,498 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 908 transitions. Word has length 64 [2019-10-13 20:04:55,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:04:55,499 INFO L462 AbstractCegarLoop]: Abstraction has 614 states and 908 transitions. [2019-10-13 20:04:55,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 20:04:55,499 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 908 transitions. [2019-10-13 20:04:55,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-13 20:04:55,507 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:04:55,507 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:04:55,508 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:04:55,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:04:55,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1140309603, now seen corresponding path program 1 times [2019-10-13 20:04:55,509 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:04:55,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837321491] [2019-10-13 20:04:55,509 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:04:55,509 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:04:55,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:04:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:04:55,699 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:04:55,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837321491] [2019-10-13 20:04:55,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:04:55,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 20:04:55,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344700159] [2019-10-13 20:04:55,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 20:04:55,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:04:55,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 20:04:55,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 20:04:55,704 INFO L87 Difference]: Start difference. First operand 614 states and 908 transitions. Second operand 4 states. [2019-10-13 20:04:57,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:04:57,524 INFO L93 Difference]: Finished difference Result 2375 states and 3593 transitions. [2019-10-13 20:04:57,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 20:04:57,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-13 20:04:57,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:04:57,539 INFO L225 Difference]: With dead ends: 2375 [2019-10-13 20:04:57,539 INFO L226 Difference]: Without dead ends: 1767 [2019-10-13 20:04:57,542 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 20:04:57,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-10-13 20:04:57,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1750. [2019-10-13 20:04:57,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2019-10-13 20:04:57,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2496 transitions. [2019-10-13 20:04:57,626 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2496 transitions. Word has length 137 [2019-10-13 20:04:57,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:04:57,627 INFO L462 AbstractCegarLoop]: Abstraction has 1750 states and 2496 transitions. [2019-10-13 20:04:57,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 20:04:57,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2496 transitions. [2019-10-13 20:04:57,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-13 20:04:57,646 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:04:57,646 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:04:57,646 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:04:57,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:04:57,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1496412874, now seen corresponding path program 1 times [2019-10-13 20:04:57,647 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:04:57,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949528206] [2019-10-13 20:04:57,647 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:04:57,648 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:04:57,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:04:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:04:57,867 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:04:57,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949528206] [2019-10-13 20:04:57,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:04:57,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 20:04:57,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368779994] [2019-10-13 20:04:57,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 20:04:57,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:04:57,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 20:04:57,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 20:04:57,872 INFO L87 Difference]: Start difference. First operand 1750 states and 2496 transitions. Second operand 6 states. [2019-10-13 20:05:00,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:05:00,519 INFO L93 Difference]: Finished difference Result 6373 states and 10724 transitions. [2019-10-13 20:05:00,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 20:05:00,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2019-10-13 20:05:00,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:05:00,565 INFO L225 Difference]: With dead ends: 6373 [2019-10-13 20:05:00,565 INFO L226 Difference]: Without dead ends: 4629 [2019-10-13 20:05:00,573 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-10-13 20:05:00,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4629 states. [2019-10-13 20:05:00,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4629 to 3937. [2019-10-13 20:05:00,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3937 states. [2019-10-13 20:05:00,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3937 states to 3937 states and 5685 transitions. [2019-10-13 20:05:00,787 INFO L78 Accepts]: Start accepts. Automaton has 3937 states and 5685 transitions. Word has length 162 [2019-10-13 20:05:00,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:05:00,788 INFO L462 AbstractCegarLoop]: Abstraction has 3937 states and 5685 transitions. [2019-10-13 20:05:00,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 20:05:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 3937 states and 5685 transitions. [2019-10-13 20:05:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-13 20:05:00,798 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:05:00,799 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:05:00,799 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:05:00,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:05:00,799 INFO L82 PathProgramCache]: Analyzing trace with hash -176162622, now seen corresponding path program 1 times [2019-10-13 20:05:00,800 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:05:00,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070609002] [2019-10-13 20:05:00,800 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:00,800 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:00,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:05:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-13 20:05:01,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070609002] [2019-10-13 20:05:01,085 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:05:01,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 20:05:01,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121837755] [2019-10-13 20:05:01,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 20:05:01,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:05:01,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 20:05:01,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 20:05:01,089 INFO L87 Difference]: Start difference. First operand 3937 states and 5685 transitions. Second operand 4 states. [2019-10-13 20:05:02,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:05:02,967 INFO L93 Difference]: Finished difference Result 10387 states and 16283 transitions. [2019-10-13 20:05:02,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 20:05:02,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 227 [2019-10-13 20:05:02,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:05:03,005 INFO L225 Difference]: With dead ends: 10387 [2019-10-13 20:05:03,006 INFO L226 Difference]: Without dead ends: 6456 [2019-10-13 20:05:03,025 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 20:05:03,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6456 states. [2019-10-13 20:05:03,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6456 to 5880. [2019-10-13 20:05:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5880 states. [2019-10-13 20:05:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5880 states to 5880 states and 8312 transitions. [2019-10-13 20:05:03,220 INFO L78 Accepts]: Start accepts. Automaton has 5880 states and 8312 transitions. Word has length 227 [2019-10-13 20:05:03,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:05:03,220 INFO L462 AbstractCegarLoop]: Abstraction has 5880 states and 8312 transitions. [2019-10-13 20:05:03,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 20:05:03,221 INFO L276 IsEmpty]: Start isEmpty. Operand 5880 states and 8312 transitions. [2019-10-13 20:05:03,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-13 20:05:03,230 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:05:03,231 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:05:03,231 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:05:03,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:05:03,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1301706544, now seen corresponding path program 1 times [2019-10-13 20:05:03,232 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:05:03,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210042733] [2019-10-13 20:05:03,232 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:03,232 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:03,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:05:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:03,761 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 67 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:05:03,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210042733] [2019-10-13 20:05:03,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709705920] [2019-10-13 20:05:03,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:05:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:03,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 20:05:03,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:05:04,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:05:04,131 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-13 20:05:04,131 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:05:04,340 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-10-13 20:05:04,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:05:04,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:05:04,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:05:04,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:05:04,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:05:04,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:05:04,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:05:04,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:05:04,757 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 114 proven. 69 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 20:05:04,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 20:05:04,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 5] total 16 [2019-10-13 20:05:04,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277431753] [2019-10-13 20:05:04,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 20:05:04,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:05:04,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 20:05:04,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-10-13 20:05:04,761 INFO L87 Difference]: Start difference. First operand 5880 states and 8312 transitions. Second operand 5 states. [2019-10-13 20:05:06,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:05:06,564 INFO L93 Difference]: Finished difference Result 11827 states and 16894 transitions. [2019-10-13 20:05:06,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 20:05:06,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-10-13 20:05:06,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:05:06,597 INFO L225 Difference]: With dead ends: 11827 [2019-10-13 20:05:06,597 INFO L226 Difference]: Without dead ends: 5953 [2019-10-13 20:05:06,619 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 459 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-10-13 20:05:06,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5953 states. [2019-10-13 20:05:06,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5953 to 5558. [2019-10-13 20:05:06,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5558 states. [2019-10-13 20:05:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 7920 transitions. [2019-10-13 20:05:06,829 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 7920 transitions. Word has length 231 [2019-10-13 20:05:06,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:05:06,829 INFO L462 AbstractCegarLoop]: Abstraction has 5558 states and 7920 transitions. [2019-10-13 20:05:06,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 20:05:06,830 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 7920 transitions. [2019-10-13 20:05:06,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-10-13 20:05:06,843 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:05:06,843 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:05:07,047 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:05:07,048 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:05:07,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:05:07,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1265711923, now seen corresponding path program 1 times [2019-10-13 20:05:07,049 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:05:07,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312938077] [2019-10-13 20:05:07,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:07,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:07,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:05:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 114 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 20:05:07,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312938077] [2019-10-13 20:05:07,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693729767] [2019-10-13 20:05:07,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:05:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:07,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 20:05:07,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:05:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-13 20:05:07,571 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:05:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 114 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 20:05:07,728 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 20:05:07,728 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2019-10-13 20:05:07,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130713832] [2019-10-13 20:05:07,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 20:05:07,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:05:07,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 20:05:07,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-13 20:05:07,731 INFO L87 Difference]: Start difference. First operand 5558 states and 7920 transitions. Second operand 5 states. [2019-10-13 20:05:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:05:09,614 INFO L93 Difference]: Finished difference Result 12573 states and 18430 transitions. [2019-10-13 20:05:09,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 20:05:09,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 277 [2019-10-13 20:05:09,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:05:09,660 INFO L225 Difference]: With dead ends: 12573 [2019-10-13 20:05:09,660 INFO L226 Difference]: Without dead ends: 7021 [2019-10-13 20:05:09,682 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 550 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-10-13 20:05:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7021 states. [2019-10-13 20:05:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7021 to 6372. [2019-10-13 20:05:09,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6372 states. [2019-10-13 20:05:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6372 states to 6372 states and 8933 transitions. [2019-10-13 20:05:09,873 INFO L78 Accepts]: Start accepts. Automaton has 6372 states and 8933 transitions. Word has length 277 [2019-10-13 20:05:09,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:05:09,873 INFO L462 AbstractCegarLoop]: Abstraction has 6372 states and 8933 transitions. [2019-10-13 20:05:09,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 20:05:09,873 INFO L276 IsEmpty]: Start isEmpty. Operand 6372 states and 8933 transitions. [2019-10-13 20:05:09,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-13 20:05:09,884 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:05:09,884 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:05:10,098 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:05:10,098 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:05:10,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:05:10,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1483392048, now seen corresponding path program 1 times [2019-10-13 20:05:10,099 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:05:10,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763354053] [2019-10-13 20:05:10,099 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:10,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:10,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:05:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:10,305 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-10-13 20:05:10,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763354053] [2019-10-13 20:05:10,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:05:10,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 20:05:10,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965343725] [2019-10-13 20:05:10,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:05:10,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:05:10,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:05:10,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:05:10,309 INFO L87 Difference]: Start difference. First operand 6372 states and 8933 transitions. Second operand 3 states. [2019-10-13 20:05:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:05:11,606 INFO L93 Difference]: Finished difference Result 14064 states and 20135 transitions. [2019-10-13 20:05:11,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:05:11,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 286 [2019-10-13 20:05:11,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:05:11,725 INFO L225 Difference]: With dead ends: 14064 [2019-10-13 20:05:11,725 INFO L226 Difference]: Without dead ends: 7886 [2019-10-13 20:05:11,749 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:05:11,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7886 states. [2019-10-13 20:05:11,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7886 to 7886. [2019-10-13 20:05:11,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7886 states. [2019-10-13 20:05:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7886 states to 7886 states and 10912 transitions. [2019-10-13 20:05:11,945 INFO L78 Accepts]: Start accepts. Automaton has 7886 states and 10912 transitions. Word has length 286 [2019-10-13 20:05:11,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:05:11,946 INFO L462 AbstractCegarLoop]: Abstraction has 7886 states and 10912 transitions. [2019-10-13 20:05:11,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:05:11,946 INFO L276 IsEmpty]: Start isEmpty. Operand 7886 states and 10912 transitions. [2019-10-13 20:05:11,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-10-13 20:05:11,960 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:05:11,960 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:05:11,960 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:05:11,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:05:11,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1126983561, now seen corresponding path program 1 times [2019-10-13 20:05:11,962 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:05:11,962 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901659146] [2019-10-13 20:05:11,962 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:11,962 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:11,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:05:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:12,206 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 212 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:05:12,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901659146] [2019-10-13 20:05:12,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991058772] [2019-10-13 20:05:12,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:05:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:12,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 20:05:12,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:05:12,414 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-13 20:05:12,415 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:05:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-13 20:05:12,591 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 20:05:12,591 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-13 20:05:12,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794771008] [2019-10-13 20:05:12,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:05:12,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:05:12,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:05:12,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 20:05:12,594 INFO L87 Difference]: Start difference. First operand 7886 states and 10912 transitions. Second operand 3 states. [2019-10-13 20:05:13,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:05:13,715 INFO L93 Difference]: Finished difference Result 17682 states and 24803 transitions. [2019-10-13 20:05:13,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:05:13,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2019-10-13 20:05:13,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:05:13,760 INFO L225 Difference]: With dead ends: 17682 [2019-10-13 20:05:13,761 INFO L226 Difference]: Without dead ends: 9990 [2019-10-13 20:05:13,781 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 20:05:13,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9990 states. [2019-10-13 20:05:13,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9990 to 9793. [2019-10-13 20:05:13,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9793 states. [2019-10-13 20:05:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9793 states to 9793 states and 13356 transitions. [2019-10-13 20:05:14,021 INFO L78 Accepts]: Start accepts. Automaton has 9793 states and 13356 transitions. Word has length 297 [2019-10-13 20:05:14,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:05:14,022 INFO L462 AbstractCegarLoop]: Abstraction has 9793 states and 13356 transitions. [2019-10-13 20:05:14,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:05:14,022 INFO L276 IsEmpty]: Start isEmpty. Operand 9793 states and 13356 transitions. [2019-10-13 20:05:14,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-10-13 20:05:14,039 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:05:14,039 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:05:14,244 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:05:14,244 INFO L410 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:05:14,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:05:14,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1649361938, now seen corresponding path program 1 times [2019-10-13 20:05:14,245 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:05:14,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235816577] [2019-10-13 20:05:14,245 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:14,245 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:14,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:05:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 88 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:05:14,710 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235816577] [2019-10-13 20:05:14,710 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118680082] [2019-10-13 20:05:14,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:05:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:14,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 20:05:14,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:05:14,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:05:15,048 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 206 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:05:15,048 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:05:15,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:05:15,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:05:15,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:05:15,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:05:15,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:05:15,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:05:15,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:05:15,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:05:15,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:05:15,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:05:15,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:05:15,857 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 115 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:05:15,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [2127793011] [2019-10-13 20:05:15,863 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 306 [2019-10-13 20:05:15,918 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 20:05:15,918 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)