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-13a467a-m [2019-10-15 00:03:46,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 00:03:46,096 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 00:03:46,111 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 00:03:46,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 00:03:46,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 00:03:46,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 00:03:46,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 00:03:46,118 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 00:03:46,119 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 00:03:46,120 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 00:03:46,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 00:03:46,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 00:03:46,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 00:03:46,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 00:03:46,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 00:03:46,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 00:03:46,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 00:03:46,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 00:03:46,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 00:03:46,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 00:03:46,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 00:03:46,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 00:03:46,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 00:03:46,138 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 00:03:46,138 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 00:03:46,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 00:03:46,139 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 00:03:46,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 00:03:46,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 00:03:46,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 00:03:46,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 00:03:46,142 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 00:03:46,143 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 00:03:46,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 00:03:46,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 00:03:46,149 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 00:03:46,149 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 00:03:46,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 00:03:46,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 00:03:46,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 00:03:46,153 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 00:03:46,175 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 00:03:46,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 00:03:46,177 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 00:03:46,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 00:03:46,177 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 00:03:46,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 00:03:46,178 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 00:03:46,178 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 00:03:46,178 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 00:03:46,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 00:03:46,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 00:03:46,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 00:03:46,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 00:03:46,179 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 00:03:46,180 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 00:03:46,180 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 00:03:46,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 00:03:46,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 00:03:46,180 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 00:03:46,181 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 00:03:46,181 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 00:03:46,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 00:03:46,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 00:03:46,182 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 00:03:46,182 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 00:03:46,182 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 00:03:46,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 00:03:46,182 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 00:03:46,183 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 00:03:46,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 00:03:46,485 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 00:03:46,489 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 00:03:46,491 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 00:03:46,491 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 00:03:46,492 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-15 00:03:46,568 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8164d3b04/7e43ceb74b634a8c994ae08b2e668f44/FLAGb10993033 [2019-10-15 00:03:47,193 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 00:03:47,196 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label35.c [2019-10-15 00:03:47,211 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8164d3b04/7e43ceb74b634a8c994ae08b2e668f44/FLAGb10993033 [2019-10-15 00:03:47,383 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8164d3b04/7e43ceb74b634a8c994ae08b2e668f44 [2019-10-15 00:03:47,392 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 00:03:47,394 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 00:03:47,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 00:03:47,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 00:03:47,399 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 00:03:47,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:03:47" (1/1) ... [2019-10-15 00:03:47,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ef49b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:03:47, skipping insertion in model container [2019-10-15 00:03:47,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:03:47" (1/1) ... [2019-10-15 00:03:47,411 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 00:03:47,485 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 00:03:48,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:03:48,107 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 00:03:48,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:03:48,536 INFO L192 MainTranslator]: Completed translation [2019-10-15 00:03:48,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:03:48 WrapperNode [2019-10-15 00:03:48,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 00:03:48,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 00:03:48,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 00:03:48,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 00:03:48,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:03:48" (1/1) ... [2019-10-15 00:03:48,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:03:48" (1/1) ... [2019-10-15 00:03:48,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:03:48" (1/1) ... [2019-10-15 00:03:48,601 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:03:48" (1/1) ... [2019-10-15 00:03:48,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:03:48" (1/1) ... [2019-10-15 00:03:48,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:03:48" (1/1) ... [2019-10-15 00:03:48,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:03:48" (1/1) ... [2019-10-15 00:03:48,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 00:03:48,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 00:03:48,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 00:03:48,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 00:03:48,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:03:48" (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 00:03:48,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 00:03:48,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 00:03:48,804 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-15 00:03:48,804 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 00:03:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-15 00:03:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 00:03:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 00:03:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 00:03:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 00:03:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 00:03:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 00:03:50,649 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 00:03:50,649 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 00:03:50,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:03:50 BoogieIcfgContainer [2019-10-15 00:03:50,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 00:03:50,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 00:03:50,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 00:03:50,657 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 00:03:50,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 12:03:47" (1/3) ... [2019-10-15 00:03:50,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5766cd8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:03:50, skipping insertion in model container [2019-10-15 00:03:50,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:03:48" (2/3) ... [2019-10-15 00:03:50,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5766cd8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:03:50, skipping insertion in model container [2019-10-15 00:03:50,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:03:50" (3/3) ... [2019-10-15 00:03:50,662 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label35.c [2019-10-15 00:03:50,673 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 00:03:50,686 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 00:03:50,698 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 00:03:50,744 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 00:03:50,744 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 00:03:50,744 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 00:03:50,744 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 00:03:50,744 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 00:03:50,745 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 00:03:50,745 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 00:03:50,745 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 00:03:50,787 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2019-10-15 00:03:50,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-15 00:03:50,800 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:03:50,801 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-15 00:03:50,804 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:03:50,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:03:50,811 INFO L82 PathProgramCache]: Analyzing trace with hash 524759243, now seen corresponding path program 1 times [2019-10-15 00:03:50,823 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:03:50,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761508722] [2019-10-15 00:03:50,824 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:03:50,825 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:03:50,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:03:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:03:51,277 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 00:03:51,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761508722] [2019-10-15 00:03:51,279 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:03:51,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:03:51,279 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262741365] [2019-10-15 00:03:51,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:03:51,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:03:51,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:03:51,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:03:51,305 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 4 states. [2019-10-15 00:03:53,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:03:53,607 INFO L93 Difference]: Finished difference Result 994 states and 1776 transitions. [2019-10-15 00:03:53,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:03:53,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-10-15 00:03:53,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:03:53,640 INFO L225 Difference]: With dead ends: 994 [2019-10-15 00:03:53,641 INFO L226 Difference]: Without dead ends: 620 [2019-10-15 00:03:53,654 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-15 00:03:53,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-15 00:03:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 614. [2019-10-15 00:03:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-15 00:03:53,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 908 transitions. [2019-10-15 00:03:53,756 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 908 transitions. Word has length 64 [2019-10-15 00:03:53,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:03:53,757 INFO L462 AbstractCegarLoop]: Abstraction has 614 states and 908 transitions. [2019-10-15 00:03:53,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:03:53,759 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 908 transitions. [2019-10-15 00:03:53,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-15 00:03:53,773 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:03:53,773 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-15 00:03:53,774 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:03:53,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:03:53,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1140309603, now seen corresponding path program 1 times [2019-10-15 00:03:53,775 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:03:53,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431131824] [2019-10-15 00:03:53,775 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:03:53,775 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:03:53,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:03:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:03:53,931 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-15 00:03:53,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431131824] [2019-10-15 00:03:53,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:03:53,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:03:53,933 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215876947] [2019-10-15 00:03:53,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:03:53,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:03:53,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:03:53,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:03:53,936 INFO L87 Difference]: Start difference. First operand 614 states and 908 transitions. Second operand 4 states. [2019-10-15 00:03:55,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:03:55,882 INFO L93 Difference]: Finished difference Result 2375 states and 3593 transitions. [2019-10-15 00:03:55,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:03:55,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-15 00:03:55,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:03:55,896 INFO L225 Difference]: With dead ends: 2375 [2019-10-15 00:03:55,896 INFO L226 Difference]: Without dead ends: 1767 [2019-10-15 00:03:55,900 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-15 00:03:55,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-10-15 00:03:55,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1750. [2019-10-15 00:03:55,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2019-10-15 00:03:55,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2496 transitions. [2019-10-15 00:03:55,977 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2496 transitions. Word has length 137 [2019-10-15 00:03:55,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:03:55,978 INFO L462 AbstractCegarLoop]: Abstraction has 1750 states and 2496 transitions. [2019-10-15 00:03:55,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:03:55,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2496 transitions. [2019-10-15 00:03:55,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-15 00:03:55,983 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:03:55,984 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-15 00:03:55,984 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:03:55,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:03:55,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1496412874, now seen corresponding path program 1 times [2019-10-15 00:03:55,985 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:03:55,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289250089] [2019-10-15 00:03:55,985 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:03:55,986 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:03:55,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:03:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:03:56,238 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-15 00:03:56,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289250089] [2019-10-15 00:03:56,239 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:03:56,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 00:03:56,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696692475] [2019-10-15 00:03:56,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 00:03:56,240 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:03:56,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 00:03:56,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 00:03:56,242 INFO L87 Difference]: Start difference. First operand 1750 states and 2496 transitions. Second operand 6 states. [2019-10-15 00:03:59,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:03:59,014 INFO L93 Difference]: Finished difference Result 6373 states and 10724 transitions. [2019-10-15 00:03:59,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 00:03:59,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2019-10-15 00:03:59,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:03:59,064 INFO L225 Difference]: With dead ends: 6373 [2019-10-15 00:03:59,065 INFO L226 Difference]: Without dead ends: 4629 [2019-10-15 00:03:59,076 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-15 00:03:59,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4629 states. [2019-10-15 00:03:59,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4629 to 3937. [2019-10-15 00:03:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3937 states. [2019-10-15 00:03:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3937 states to 3937 states and 5685 transitions. [2019-10-15 00:03:59,293 INFO L78 Accepts]: Start accepts. Automaton has 3937 states and 5685 transitions. Word has length 162 [2019-10-15 00:03:59,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:03:59,295 INFO L462 AbstractCegarLoop]: Abstraction has 3937 states and 5685 transitions. [2019-10-15 00:03:59,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 00:03:59,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3937 states and 5685 transitions. [2019-10-15 00:03:59,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-15 00:03:59,304 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:03:59,304 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-15 00:03:59,304 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:03:59,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:03:59,305 INFO L82 PathProgramCache]: Analyzing trace with hash -176162622, now seen corresponding path program 1 times [2019-10-15 00:03:59,305 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:03:59,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923491994] [2019-10-15 00:03:59,305 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:03:59,306 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:03:59,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:03:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:03:59,597 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-15 00:03:59,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923491994] [2019-10-15 00:03:59,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:03:59,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:03:59,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375275186] [2019-10-15 00:03:59,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:03:59,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:03:59,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:03:59,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:03:59,601 INFO L87 Difference]: Start difference. First operand 3937 states and 5685 transitions. Second operand 4 states. [2019-10-15 00:04:01,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:04:01,259 INFO L93 Difference]: Finished difference Result 10387 states and 16283 transitions. [2019-10-15 00:04:01,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:04:01,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 227 [2019-10-15 00:04:01,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:04:01,310 INFO L225 Difference]: With dead ends: 10387 [2019-10-15 00:04:01,311 INFO L226 Difference]: Without dead ends: 6456 [2019-10-15 00:04:01,337 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-15 00:04:01,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6456 states. [2019-10-15 00:04:01,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6456 to 5880. [2019-10-15 00:04:01,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5880 states. [2019-10-15 00:04:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5880 states to 5880 states and 8312 transitions. [2019-10-15 00:04:01,581 INFO L78 Accepts]: Start accepts. Automaton has 5880 states and 8312 transitions. Word has length 227 [2019-10-15 00:04:01,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:04:01,582 INFO L462 AbstractCegarLoop]: Abstraction has 5880 states and 8312 transitions. [2019-10-15 00:04:01,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:04:01,582 INFO L276 IsEmpty]: Start isEmpty. Operand 5880 states and 8312 transitions. [2019-10-15 00:04:01,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-15 00:04:01,593 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:04:01,593 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-15 00:04:01,594 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:04:01,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:04:01,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1301706544, now seen corresponding path program 1 times [2019-10-15 00:04:01,594 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:04:01,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557189491] [2019-10-15 00:04:01,595 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:01,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:01,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:04:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:02,039 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-15 00:04:02,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557189491] [2019-10-15 00:04:02,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186959597] [2019-10-15 00:04:02,040 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-15 00:04:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:02,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-15 00:04:02,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:04:02,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:04:02,401 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-15 00:04:02,401 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:04:02,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:02,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:02,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:02,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:02,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:02,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:02,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:02,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:02,887 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-15 00:04:02,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 00:04:02,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 5] total 16 [2019-10-15 00:04:02,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065740109] [2019-10-15 00:04:02,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:04:02,889 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:04:02,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:04:02,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-10-15 00:04:02,889 INFO L87 Difference]: Start difference. First operand 5880 states and 8312 transitions. Second operand 5 states. [2019-10-15 00:04:04,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:04:04,692 INFO L93 Difference]: Finished difference Result 11827 states and 16894 transitions. [2019-10-15 00:04:04,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 00:04:04,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-10-15 00:04:04,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:04:04,728 INFO L225 Difference]: With dead ends: 11827 [2019-10-15 00:04:04,729 INFO L226 Difference]: Without dead ends: 5953 [2019-10-15 00:04:04,751 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-15 00:04:04,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5953 states. [2019-10-15 00:04:04,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5953 to 5558. [2019-10-15 00:04:04,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5558 states. [2019-10-15 00:04:05,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 7920 transitions. [2019-10-15 00:04:05,010 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 7920 transitions. Word has length 231 [2019-10-15 00:04:05,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:04:05,011 INFO L462 AbstractCegarLoop]: Abstraction has 5558 states and 7920 transitions. [2019-10-15 00:04:05,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:04:05,013 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 7920 transitions. [2019-10-15 00:04:05,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-10-15 00:04:05,027 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:04:05,028 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-15 00:04:05,236 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:04:05,236 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:04:05,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:04:05,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1265711923, now seen corresponding path program 1 times [2019-10-15 00:04:05,237 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:04:05,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506100840] [2019-10-15 00:04:05,238 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:05,238 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:05,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:04:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:05,482 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-15 00:04:05,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506100840] [2019-10-15 00:04:05,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91760412] [2019-10-15 00:04:05,484 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-15 00:04:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:05,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 00:04:05,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:04:05,734 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-15 00:04:05,734 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:04:05,913 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-15 00:04:05,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 00:04:05,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2019-10-15 00:04:05,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649711701] [2019-10-15 00:04:05,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:04:05,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:04:05,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:04:05,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-15 00:04:05,916 INFO L87 Difference]: Start difference. First operand 5558 states and 7920 transitions. Second operand 5 states. [2019-10-15 00:04:07,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:04:07,710 INFO L93 Difference]: Finished difference Result 12573 states and 18430 transitions. [2019-10-15 00:04:07,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 00:04:07,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 277 [2019-10-15 00:04:07,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:04:07,758 INFO L225 Difference]: With dead ends: 12573 [2019-10-15 00:04:07,758 INFO L226 Difference]: Without dead ends: 7021 [2019-10-15 00:04:07,781 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-15 00:04:07,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7021 states. [2019-10-15 00:04:08,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7021 to 6372. [2019-10-15 00:04:08,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6372 states. [2019-10-15 00:04:08,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6372 states to 6372 states and 8933 transitions. [2019-10-15 00:04:08,090 INFO L78 Accepts]: Start accepts. Automaton has 6372 states and 8933 transitions. Word has length 277 [2019-10-15 00:04:08,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:04:08,091 INFO L462 AbstractCegarLoop]: Abstraction has 6372 states and 8933 transitions. [2019-10-15 00:04:08,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:04:08,091 INFO L276 IsEmpty]: Start isEmpty. Operand 6372 states and 8933 transitions. [2019-10-15 00:04:08,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-15 00:04:08,108 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:04:08,108 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-15 00:04:08,320 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:04:08,321 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:04:08,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:04:08,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1483392048, now seen corresponding path program 1 times [2019-10-15 00:04:08,322 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:04:08,322 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91929986] [2019-10-15 00:04:08,322 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:08,322 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:08,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:04:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:08,576 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-15 00:04:08,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91929986] [2019-10-15 00:04:08,576 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:04:08,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:04:08,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884684876] [2019-10-15 00:04:08,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:04:08,578 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:04:08,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:04:08,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:04:08,579 INFO L87 Difference]: Start difference. First operand 6372 states and 8933 transitions. Second operand 3 states. [2019-10-15 00:04:09,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:04:09,797 INFO L93 Difference]: Finished difference Result 14064 states and 20135 transitions. [2019-10-15 00:04:09,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:04:09,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 286 [2019-10-15 00:04:09,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:04:09,827 INFO L225 Difference]: With dead ends: 14064 [2019-10-15 00:04:09,827 INFO L226 Difference]: Without dead ends: 7886 [2019-10-15 00:04:09,849 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-15 00:04:09,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7886 states. [2019-10-15 00:04:10,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7886 to 7886. [2019-10-15 00:04:10,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7886 states. [2019-10-15 00:04:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7886 states to 7886 states and 10912 transitions. [2019-10-15 00:04:10,209 INFO L78 Accepts]: Start accepts. Automaton has 7886 states and 10912 transitions. Word has length 286 [2019-10-15 00:04:10,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:04:10,210 INFO L462 AbstractCegarLoop]: Abstraction has 7886 states and 10912 transitions. [2019-10-15 00:04:10,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:04:10,210 INFO L276 IsEmpty]: Start isEmpty. Operand 7886 states and 10912 transitions. [2019-10-15 00:04:10,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-10-15 00:04:10,229 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:04:10,229 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-15 00:04:10,230 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:04:10,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:04:10,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1126983561, now seen corresponding path program 1 times [2019-10-15 00:04:10,231 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:04:10,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969999854] [2019-10-15 00:04:10,231 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:10,231 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:10,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:04:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:10,474 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-15 00:04:10,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969999854] [2019-10-15 00:04:10,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554076117] [2019-10-15 00:04:10,475 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-15 00:04:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:10,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 00:04:10,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:04:10,639 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-15 00:04:10,639 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:04:10,764 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-15 00:04:10,764 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 00:04:10,764 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-15 00:04:10,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123755696] [2019-10-15 00:04:10,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:04:10,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:04:10,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:04:10,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-15 00:04:10,767 INFO L87 Difference]: Start difference. First operand 7886 states and 10912 transitions. Second operand 3 states. [2019-10-15 00:04:11,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:04:11,882 INFO L93 Difference]: Finished difference Result 17682 states and 24803 transitions. [2019-10-15 00:04:11,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:04:11,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2019-10-15 00:04:11,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:04:11,928 INFO L225 Difference]: With dead ends: 17682 [2019-10-15 00:04:11,928 INFO L226 Difference]: Without dead ends: 9990 [2019-10-15 00:04:11,948 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-15 00:04:11,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9990 states. [2019-10-15 00:04:12,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9990 to 9793. [2019-10-15 00:04:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9793 states. [2019-10-15 00:04:12,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9793 states to 9793 states and 13356 transitions. [2019-10-15 00:04:12,185 INFO L78 Accepts]: Start accepts. Automaton has 9793 states and 13356 transitions. Word has length 297 [2019-10-15 00:04:12,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:04:12,185 INFO L462 AbstractCegarLoop]: Abstraction has 9793 states and 13356 transitions. [2019-10-15 00:04:12,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:04:12,186 INFO L276 IsEmpty]: Start isEmpty. Operand 9793 states and 13356 transitions. [2019-10-15 00:04:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-10-15 00:04:12,203 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:04:12,203 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-15 00:04:12,408 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:04:12,408 INFO L410 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:04:12,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:04:12,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1649361938, now seen corresponding path program 1 times [2019-10-15 00:04:12,409 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:04:12,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166918383] [2019-10-15 00:04:12,410 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:12,410 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:12,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:04:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:13,010 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-15 00:04:13,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166918383] [2019-10-15 00:04:13,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957745975] [2019-10-15 00:04:13,012 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-15 00:04:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:13,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-15 00:04:13,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:04:13,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:04:13,371 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-15 00:04:13,371 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:04:13,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:13,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:04:13,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:13,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:13,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:13,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:04:13,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:13,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:13,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:13,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:13,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:14,144 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-15 00:04:14,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1282205862] [2019-10-15 00:04:14,150 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 306 [2019-10-15 00:04:14,200 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 00:04:14,200 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)