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/Problem10_label25.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 20:02:06,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 20:02:06,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 20:02:06,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 20:02:06,057 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 20:02:06,060 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 20:02:06,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 20:02:06,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 20:02:06,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 20:02:06,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 20:02:06,079 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 20:02:06,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 20:02:06,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 20:02:06,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 20:02:06,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 20:02:06,087 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 20:02:06,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 20:02:06,090 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 20:02:06,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 20:02:06,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 20:02:06,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 20:02:06,104 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 20:02:06,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 20:02:06,108 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 20:02:06,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 20:02:06,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 20:02:06,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 20:02:06,113 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 20:02:06,115 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 20:02:06,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 20:02:06,116 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 20:02:06,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 20:02:06,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 20:02:06,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 20:02:06,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 20:02:06,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 20:02:06,121 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 20:02:06,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 20:02:06,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 20:02:06,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 20:02:06,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 20:02:06,126 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:02:06,149 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 20:02:06,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 20:02:06,152 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 20:02:06,152 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 20:02:06,153 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 20:02:06,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 20:02:06,153 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 20:02:06,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 20:02:06,153 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 20:02:06,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 20:02:06,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 20:02:06,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 20:02:06,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 20:02:06,156 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 20:02:06,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 20:02:06,156 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 20:02:06,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 20:02:06,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 20:02:06,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 20:02:06,157 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 20:02:06,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 20:02:06,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:02:06,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 20:02:06,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 20:02:06,158 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 20:02:06,158 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 20:02:06,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 20:02:06,158 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 20:02:06,159 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:02:06,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 20:02:06,512 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 20:02:06,516 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 20:02:06,517 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 20:02:06,518 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 20:02:06,518 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label25.c [2019-10-13 20:02:06,590 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffe37baae/cbce451e7d59484cbab82a4477ba6a97/FLAG8dff15d2b [2019-10-13 20:02:07,174 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 20:02:07,175 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label25.c [2019-10-13 20:02:07,195 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffe37baae/cbce451e7d59484cbab82a4477ba6a97/FLAG8dff15d2b [2019-10-13 20:02:07,399 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffe37baae/cbce451e7d59484cbab82a4477ba6a97 [2019-10-13 20:02:07,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 20:02:07,411 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 20:02:07,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 20:02:07,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 20:02:07,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 20:02:07,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:02:07" (1/1) ... [2019-10-13 20:02:07,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db268e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:02:07, skipping insertion in model container [2019-10-13 20:02:07,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:02:07" (1/1) ... [2019-10-13 20:02:07,432 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 20:02:07,494 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 20:02:07,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:02:07,998 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 20:02:08,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:02:08,110 INFO L192 MainTranslator]: Completed translation [2019-10-13 20:02:08,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:02:08 WrapperNode [2019-10-13 20:02:08,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 20:02:08,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 20:02:08,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 20:02:08,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 20:02:08,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:02:08" (1/1) ... [2019-10-13 20:02:08,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:02:08" (1/1) ... [2019-10-13 20:02:08,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:02:08" (1/1) ... [2019-10-13 20:02:08,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:02:08" (1/1) ... [2019-10-13 20:02:08,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:02:08" (1/1) ... [2019-10-13 20:02:08,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:02:08" (1/1) ... [2019-10-13 20:02:08,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:02:08" (1/1) ... [2019-10-13 20:02:08,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 20:02:08,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 20:02:08,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 20:02:08,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 20:02:08,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:02:08" (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:02:08,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 20:02:08,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 20:02:08,310 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 20:02:08,310 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 20:02:08,310 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 20:02:08,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 20:02:08,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 20:02:08,311 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 20:02:08,311 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 20:02:08,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 20:02:08,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 20:02:09,570 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 20:02:09,571 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 20:02:09,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:02:09 BoogieIcfgContainer [2019-10-13 20:02:09,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 20:02:09,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 20:02:09,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 20:02:09,579 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 20:02:09,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:02:07" (1/3) ... [2019-10-13 20:02:09,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5035f506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:02:09, skipping insertion in model container [2019-10-13 20:02:09,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:02:08" (2/3) ... [2019-10-13 20:02:09,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5035f506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:02:09, skipping insertion in model container [2019-10-13 20:02:09,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:02:09" (3/3) ... [2019-10-13 20:02:09,588 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label25.c [2019-10-13 20:02:09,604 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 20:02:09,612 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 20:02:09,621 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 20:02:09,647 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 20:02:09,647 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 20:02:09,647 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 20:02:09,648 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 20:02:09,648 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 20:02:09,648 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 20:02:09,648 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 20:02:09,648 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 20:02:09,678 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2019-10-13 20:02:09,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-13 20:02:09,691 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:02:09,693 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, 1, 1, 1, 1, 1, 1] [2019-10-13 20:02:09,695 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:02:09,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:02:09,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1015003737, now seen corresponding path program 1 times [2019-10-13 20:02:09,711 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:02:09,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056352294] [2019-10-13 20:02:09,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:02:09,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:02:09,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:02:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:02:10,072 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:02:10,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056352294] [2019-10-13 20:02:10,074 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:02:10,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 20:02:10,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178420551] [2019-10-13 20:02:10,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:02:10,081 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:02:10,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:02:10,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:02:10,099 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 3 states. [2019-10-13 20:02:11,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:02:11,238 INFO L93 Difference]: Finished difference Result 571 states and 989 transitions. [2019-10-13 20:02:11,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:02:11,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-10-13 20:02:11,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:02:11,271 INFO L225 Difference]: With dead ends: 571 [2019-10-13 20:02:11,271 INFO L226 Difference]: Without dead ends: 294 [2019-10-13 20:02:11,281 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:02:11,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-13 20:02:11,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2019-10-13 20:02:11,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-13 20:02:11,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 421 transitions. [2019-10-13 20:02:11,368 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 421 transitions. Word has length 70 [2019-10-13 20:02:11,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:02:11,369 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 421 transitions. [2019-10-13 20:02:11,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:02:11,370 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 421 transitions. [2019-10-13 20:02:11,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-13 20:02:11,385 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:02:11,386 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:02:11,386 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:02:11,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:02:11,387 INFO L82 PathProgramCache]: Analyzing trace with hash -195666983, now seen corresponding path program 1 times [2019-10-13 20:02:11,387 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:02:11,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381950188] [2019-10-13 20:02:11,387 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:02:11,387 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:02:11,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:02:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:02:11,615 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:02:11,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381950188] [2019-10-13 20:02:11,616 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:02:11,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 20:02:11,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370840855] [2019-10-13 20:02:11,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 20:02:11,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:02:11,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 20:02:11,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 20:02:11,620 INFO L87 Difference]: Start difference. First operand 294 states and 421 transitions. Second operand 6 states. [2019-10-13 20:02:12,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:02:12,540 INFO L93 Difference]: Finished difference Result 741 states and 1061 transitions. [2019-10-13 20:02:12,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 20:02:12,541 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2019-10-13 20:02:12,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:02:12,546 INFO L225 Difference]: With dead ends: 741 [2019-10-13 20:02:12,546 INFO L226 Difference]: Without dead ends: 453 [2019-10-13 20:02:12,548 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-13 20:02:12,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-10-13 20:02:12,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 445. [2019-10-13 20:02:12,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-10-13 20:02:12,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 606 transitions. [2019-10-13 20:02:12,593 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 606 transitions. Word has length 139 [2019-10-13 20:02:12,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:02:12,594 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 606 transitions. [2019-10-13 20:02:12,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 20:02:12,594 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 606 transitions. [2019-10-13 20:02:12,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 20:02:12,597 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:02:12,598 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, 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:02:12,598 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:02:12,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:02:12,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1516573211, now seen corresponding path program 1 times [2019-10-13 20:02:12,599 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:02:12,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559773630] [2019-10-13 20:02:12,599 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:02:12,599 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:02:12,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:02:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:02:12,805 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:02:12,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559773630] [2019-10-13 20:02:12,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:02:12,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 20:02:12,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971269543] [2019-10-13 20:02:12,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 20:02:12,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:02:12,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 20:02:12,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 20:02:12,810 INFO L87 Difference]: Start difference. First operand 445 states and 606 transitions. Second operand 4 states. [2019-10-13 20:02:13,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:02:13,859 INFO L93 Difference]: Finished difference Result 1609 states and 2232 transitions. [2019-10-13 20:02:13,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 20:02:13,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-10-13 20:02:13,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:02:13,865 INFO L225 Difference]: With dead ends: 1609 [2019-10-13 20:02:13,865 INFO L226 Difference]: Without dead ends: 735 [2019-10-13 20:02:13,867 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:02:13,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-10-13 20:02:13,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 592. [2019-10-13 20:02:13,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-13 20:02:13,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 801 transitions. [2019-10-13 20:02:13,898 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 801 transitions. Word has length 149 [2019-10-13 20:02:13,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:02:13,899 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 801 transitions. [2019-10-13 20:02:13,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 20:02:13,899 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 801 transitions. [2019-10-13 20:02:13,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-13 20:02:13,903 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:02:13,903 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, 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] [2019-10-13 20:02:13,904 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:02:13,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:02:13,904 INFO L82 PathProgramCache]: Analyzing trace with hash 2032612418, now seen corresponding path program 1 times [2019-10-13 20:02:13,905 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:02:13,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218849294] [2019-10-13 20:02:13,905 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:02:13,905 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:02:13,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:02:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:02:14,171 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:02:14,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218849294] [2019-10-13 20:02:14,172 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:02:14,172 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 20:02:14,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012603544] [2019-10-13 20:02:14,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 20:02:14,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:02:14,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 20:02:14,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 20:02:14,175 INFO L87 Difference]: Start difference. First operand 592 states and 801 transitions. Second operand 6 states. [2019-10-13 20:02:15,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:02:15,002 INFO L93 Difference]: Finished difference Result 1492 states and 2064 transitions. [2019-10-13 20:02:15,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 20:02:15,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 192 [2019-10-13 20:02:15,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:02:15,009 INFO L225 Difference]: With dead ends: 1492 [2019-10-13 20:02:15,010 INFO L226 Difference]: Without dead ends: 906 [2019-10-13 20:02:15,011 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-13 20:02:15,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-10-13 20:02:15,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 890. [2019-10-13 20:02:15,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-10-13 20:02:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1141 transitions. [2019-10-13 20:02:15,048 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1141 transitions. Word has length 192 [2019-10-13 20:02:15,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:02:15,049 INFO L462 AbstractCegarLoop]: Abstraction has 890 states and 1141 transitions. [2019-10-13 20:02:15,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 20:02:15,049 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1141 transitions. [2019-10-13 20:02:15,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-13 20:02:15,054 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:02:15,054 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:02:15,054 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:02:15,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:02:15,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1889340864, now seen corresponding path program 1 times [2019-10-13 20:02:15,055 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:02:15,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422286110] [2019-10-13 20:02:15,055 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:02:15,056 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:02:15,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:02:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:02:15,432 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 204 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:02:15,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422286110] [2019-10-13 20:02:15,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536381995] [2019-10-13 20:02:15,433 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:02:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:02:15,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 20:02:15,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:02:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-13 20:02:15,688 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:02:15,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:02:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 126 proven. 78 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 20:02:16,048 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 20:02:16,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 5] total 12 [2019-10-13 20:02:16,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616749332] [2019-10-13 20:02:16,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 20:02:16,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:02:16,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 20:02:16,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-13 20:02:16,051 INFO L87 Difference]: Start difference. First operand 890 states and 1141 transitions. Second operand 5 states. [2019-10-13 20:02:16,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:02:16,871 INFO L93 Difference]: Finished difference Result 1943 states and 2493 transitions. [2019-10-13 20:02:16,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 20:02:16,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 239 [2019-10-13 20:02:16,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:02:16,878 INFO L225 Difference]: With dead ends: 1943 [2019-10-13 20:02:16,878 INFO L226 Difference]: Without dead ends: 1059 [2019-10-13 20:02:16,881 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-13 20:02:16,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2019-10-13 20:02:16,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1047. [2019-10-13 20:02:16,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2019-10-13 20:02:16,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1325 transitions. [2019-10-13 20:02:16,917 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1325 transitions. Word has length 239 [2019-10-13 20:02:16,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:02:16,917 INFO L462 AbstractCegarLoop]: Abstraction has 1047 states and 1325 transitions. [2019-10-13 20:02:16,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 20:02:16,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1325 transitions. [2019-10-13 20:02:16,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-10-13 20:02:16,924 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:02:16,925 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-13 20:02:17,141 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:02:17,142 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:02:17,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:02:17,142 INFO L82 PathProgramCache]: Analyzing trace with hash -122970787, now seen corresponding path program 1 times [2019-10-13 20:02:17,143 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:02:17,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359602278] [2019-10-13 20:02:17,143 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:02:17,144 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:02:17,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:02:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:02:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 261 proven. 82 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-10-13 20:02:18,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359602278] [2019-10-13 20:02:18,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250429064] [2019-10-13 20:02:18,390 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:02:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:02:18,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 20:02:18,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:02:18,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:02:18,654 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 345 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-13 20:02:18,655 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:02:18,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:02:18,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:02:18,940 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 261 proven. 82 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-10-13 20:02:18,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [82847815] [2019-10-13 20:02:18,946 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 310 [2019-10-13 20:02:19,003 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 20:02:19,004 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 20:02:23,228 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.