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 -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label29.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 19:37:43,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 19:37:43,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 19:37:43,217 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 19:37:43,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 19:37:43,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 19:37:43,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 19:37:43,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 19:37:43,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 19:37:43,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 19:37:43,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 19:37:43,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 19:37:43,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 19:37:43,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 19:37:43,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 19:37:43,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 19:37:43,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 19:37:43,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 19:37:43,233 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 19:37:43,235 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 19:37:43,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 19:37:43,238 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 19:37:43,240 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 19:37:43,241 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 19:37:43,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 19:37:43,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 19:37:43,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 19:37:43,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 19:37:43,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 19:37:43,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 19:37:43,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 19:37:43,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 19:37:43,250 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 19:37:43,253 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 19:37:43,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 19:37:43,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 19:37:43,255 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 19:37:43,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 19:37:43,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 19:37:43,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 19:37:43,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 19:37:43,262 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-09-07 19:37:43,297 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 19:37:43,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 19:37:43,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 19:37:43,300 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 19:37:43,300 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 19:37:43,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 19:37:43,300 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 19:37:43,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 19:37:43,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 19:37:43,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 19:37:43,302 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 19:37:43,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 19:37:43,303 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 19:37:43,303 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 19:37:43,303 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 19:37:43,303 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 19:37:43,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 19:37:43,304 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 19:37:43,304 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 19:37:43,305 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 19:37:43,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 19:37:43,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:37:43,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 19:37:43,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 19:37:43,307 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 19:37:43,307 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 19:37:43,307 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 19:37:43,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 19:37:43,308 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 19:37:43,361 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 19:37:43,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 19:37:43,377 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 19:37:43,378 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 19:37:43,379 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 19:37:43,379 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label29.c [2019-09-07 19:37:43,452 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaa6292c5/b25dd037f50d4446a1a463803d7e3742/FLAG2f7c6fe94 [2019-09-07 19:37:44,254 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 19:37:44,256 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label29.c [2019-09-07 19:37:44,305 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaa6292c5/b25dd037f50d4446a1a463803d7e3742/FLAG2f7c6fe94 [2019-09-07 19:37:44,795 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaa6292c5/b25dd037f50d4446a1a463803d7e3742 [2019-09-07 19:37:44,805 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 19:37:44,806 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 19:37:44,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 19:37:44,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 19:37:44,811 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 19:37:44,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:37:44" (1/1) ... [2019-09-07 19:37:44,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f89b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:44, skipping insertion in model container [2019-09-07 19:37:44,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:37:44" (1/1) ... [2019-09-07 19:37:44,824 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 19:37:45,003 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 19:37:46,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:37:46,881 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 19:37:47,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:37:47,738 INFO L192 MainTranslator]: Completed translation [2019-09-07 19:37:47,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:47 WrapperNode [2019-09-07 19:37:47,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 19:37:47,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 19:37:47,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 19:37:47,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 19:37:47,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:47" (1/1) ... [2019-09-07 19:37:47,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:47" (1/1) ... [2019-09-07 19:37:47,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:47" (1/1) ... [2019-09-07 19:37:47,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:47" (1/1) ... [2019-09-07 19:37:47,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:47" (1/1) ... [2019-09-07 19:37:47,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:47" (1/1) ... [2019-09-07 19:37:48,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:47" (1/1) ... [2019-09-07 19:37:48,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 19:37:48,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 19:37:48,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 19:37:48,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 19:37:48,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:47" (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-09-07 19:37:48,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 19:37:48,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 19:37:48,158 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 19:37:48,158 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 19:37:48,159 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 19:37:48,159 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 19:37:48,159 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 19:37:48,159 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 19:37:48,159 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 19:37:48,160 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 19:37:48,160 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 19:37:48,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 19:37:48,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 19:37:48,161 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 19:37:48,162 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 19:37:48,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 19:37:48,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 19:37:54,331 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 19:37:54,331 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 19:37:54,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:37:54 BoogieIcfgContainer [2019-09-07 19:37:54,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 19:37:54,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 19:37:54,339 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 19:37:54,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 19:37:54,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:37:44" (1/3) ... [2019-09-07 19:37:54,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0d8ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:37:54, skipping insertion in model container [2019-09-07 19:37:54,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:47" (2/3) ... [2019-09-07 19:37:54,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0d8ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:37:54, skipping insertion in model container [2019-09-07 19:37:54,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:37:54" (3/3) ... [2019-09-07 19:37:54,356 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem13_label29.c [2019-09-07 19:37:54,368 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 19:37:54,380 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 19:37:54,399 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 19:37:54,451 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 19:37:54,452 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 19:37:54,452 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 19:37:54,452 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 19:37:54,452 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 19:37:54,452 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 19:37:54,453 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 19:37:54,453 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 19:37:54,453 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 19:37:54,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states. [2019-09-07 19:37:54,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 19:37:54,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:37:54,504 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:37:54,506 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:37:54,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:37:54,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1603055809, now seen corresponding path program 1 times [2019-09-07 19:37:54,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:37:54,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:37:54,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:54,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:37:54,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:54,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:37:54,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:37:54,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:37:54,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:37:54,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:37:54,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:37:54,781 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand 4 states. [2019-09-07 19:38:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:38:04,661 INFO L93 Difference]: Finished difference Result 3964 states and 7388 transitions. [2019-09-07 19:38:04,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:38:04,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-07 19:38:04,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:38:04,699 INFO L225 Difference]: With dead ends: 3964 [2019-09-07 19:38:04,700 INFO L226 Difference]: Without dead ends: 2758 [2019-09-07 19:38:04,712 INFO L628 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-09-07 19:38:04,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2019-09-07 19:38:04,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 1919. [2019-09-07 19:38:04,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1919 states. [2019-09-07 19:38:04,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 3313 transitions. [2019-09-07 19:38:04,901 INFO L78 Accepts]: Start accepts. Automaton has 1919 states and 3313 transitions. Word has length 20 [2019-09-07 19:38:04,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:38:04,901 INFO L475 AbstractCegarLoop]: Abstraction has 1919 states and 3313 transitions. [2019-09-07 19:38:04,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:38:04,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 3313 transitions. [2019-09-07 19:38:04,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-07 19:38:04,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:38:04,906 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 19:38:04,906 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:38:04,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:38:04,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1116289529, now seen corresponding path program 1 times [2019-09-07 19:38:04,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:38:04,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:38:04,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:04,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:04,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:05,163 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:38:05,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:38:05,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:38:05,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:38:05,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:38:05,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:38:05,166 INFO L87 Difference]: Start difference. First operand 1919 states and 3313 transitions. Second operand 5 states. [2019-09-07 19:38:12,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:38:12,928 INFO L93 Difference]: Finished difference Result 5545 states and 9710 transitions. [2019-09-07 19:38:12,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:38:12,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-07 19:38:12,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:38:12,952 INFO L225 Difference]: With dead ends: 5545 [2019-09-07 19:38:12,953 INFO L226 Difference]: Without dead ends: 3632 [2019-09-07 19:38:12,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:38:12,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3632 states. [2019-09-07 19:38:13,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3632 to 3623. [2019-09-07 19:38:13,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3623 states. [2019-09-07 19:38:13,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 5644 transitions. [2019-09-07 19:38:13,074 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 5644 transitions. Word has length 89 [2019-09-07 19:38:13,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:38:13,075 INFO L475 AbstractCegarLoop]: Abstraction has 3623 states and 5644 transitions. [2019-09-07 19:38:13,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:38:13,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 5644 transitions. [2019-09-07 19:38:13,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-07 19:38:13,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:38:13,082 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 19:38:13,083 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:38:13,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:38:13,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1031098467, now seen corresponding path program 1 times [2019-09-07 19:38:13,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:38:13,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:38:13,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:13,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:13,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:38:13,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:38:13,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:38:13,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:38:13,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:38:13,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:38:13,261 INFO L87 Difference]: Start difference. First operand 3623 states and 5644 transitions. Second operand 5 states. [2019-09-07 19:38:21,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:38:21,741 INFO L93 Difference]: Finished difference Result 10808 states and 17216 transitions. [2019-09-07 19:38:21,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:38:21,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-07 19:38:21,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:38:21,773 INFO L225 Difference]: With dead ends: 10808 [2019-09-07 19:38:21,776 INFO L226 Difference]: Without dead ends: 7191 [2019-09-07 19:38:21,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:38:21,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7191 states. [2019-09-07 19:38:21,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7191 to 7086. [2019-09-07 19:38:21,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7086 states. [2019-09-07 19:38:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7086 states to 7086 states and 10105 transitions. [2019-09-07 19:38:21,994 INFO L78 Accepts]: Start accepts. Automaton has 7086 states and 10105 transitions. Word has length 91 [2019-09-07 19:38:21,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:38:21,996 INFO L475 AbstractCegarLoop]: Abstraction has 7086 states and 10105 transitions. [2019-09-07 19:38:21,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:38:21,996 INFO L276 IsEmpty]: Start isEmpty. Operand 7086 states and 10105 transitions. [2019-09-07 19:38:22,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-07 19:38:22,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:38:22,009 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 19:38:22,010 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:38:22,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:38:22,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1866418581, now seen corresponding path program 1 times [2019-09-07 19:38:22,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:38:22,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:38:22,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:22,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:22,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:22,173 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:38:22,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:38:22,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:38:22,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:38:22,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:38:22,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:38:22,176 INFO L87 Difference]: Start difference. First operand 7086 states and 10105 transitions. Second operand 3 states. [2019-09-07 19:38:28,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:38:28,273 INFO L93 Difference]: Finished difference Result 20817 states and 30786 transitions. [2019-09-07 19:38:28,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:38:28,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2019-09-07 19:38:28,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:38:28,348 INFO L225 Difference]: With dead ends: 20817 [2019-09-07 19:38:28,348 INFO L226 Difference]: Without dead ends: 13737 [2019-09-07 19:38:28,370 INFO L628 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-09-07 19:38:28,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13737 states. [2019-09-07 19:38:28,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13737 to 13728. [2019-09-07 19:38:28,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13728 states. [2019-09-07 19:38:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13728 states to 13728 states and 18716 transitions. [2019-09-07 19:38:28,663 INFO L78 Accepts]: Start accepts. Automaton has 13728 states and 18716 transitions. Word has length 135 [2019-09-07 19:38:28,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:38:28,665 INFO L475 AbstractCegarLoop]: Abstraction has 13728 states and 18716 transitions. [2019-09-07 19:38:28,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:38:28,665 INFO L276 IsEmpty]: Start isEmpty. Operand 13728 states and 18716 transitions. [2019-09-07 19:38:28,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-07 19:38:28,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:38:28,668 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 19:38:28,669 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:38:28,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:38:28,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1212306063, now seen corresponding path program 1 times [2019-09-07 19:38:28,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:38:28,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:38:28,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:28,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:28,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:28,817 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:38:28,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:38:28,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:38:28,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:38:28,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:38:28,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:38:28,820 INFO L87 Difference]: Start difference. First operand 13728 states and 18716 transitions. Second operand 4 states. [2019-09-07 19:38:37,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:38:37,479 INFO L93 Difference]: Finished difference Result 52924 states and 77289 transitions. [2019-09-07 19:38:37,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:38:37,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-07 19:38:37,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:38:37,636 INFO L225 Difference]: With dead ends: 52924 [2019-09-07 19:38:37,637 INFO L226 Difference]: Without dead ends: 38394 [2019-09-07 19:38:37,687 INFO L628 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-09-07 19:38:37,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38394 states. [2019-09-07 19:38:39,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38394 to 38358. [2019-09-07 19:38:39,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38358 states. [2019-09-07 19:38:39,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38358 states to 38358 states and 52231 transitions. [2019-09-07 19:38:39,556 INFO L78 Accepts]: Start accepts. Automaton has 38358 states and 52231 transitions. Word has length 140 [2019-09-07 19:38:39,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:38:39,556 INFO L475 AbstractCegarLoop]: Abstraction has 38358 states and 52231 transitions. [2019-09-07 19:38:39,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:38:39,556 INFO L276 IsEmpty]: Start isEmpty. Operand 38358 states and 52231 transitions. [2019-09-07 19:38:39,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-07 19:38:39,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:38:39,560 INFO L399 BasicCegarLoop]: trace histogram [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, 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-09-07 19:38:39,560 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:38:39,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:38:39,561 INFO L82 PathProgramCache]: Analyzing trace with hash 957769466, now seen corresponding path program 1 times [2019-09-07 19:38:39,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:38:39,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:38:39,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:39,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:39,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:39,763 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 26 proven. 67 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 19:38:39,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:38:39,764 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:38:39,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:39,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 19:38:39,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:38:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-07 19:38:40,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:38:40,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:38:40,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:38:40,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:38:40,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:38:40,033 INFO L87 Difference]: Start difference. First operand 38358 states and 52231 transitions. Second operand 9 states. [2019-09-07 19:38:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:38:52,201 INFO L93 Difference]: Finished difference Result 102676 states and 150205 transitions. [2019-09-07 19:38:52,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 19:38:52,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 177 [2019-09-07 19:38:52,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:38:52,570 INFO L225 Difference]: With dead ends: 102676 [2019-09-07 19:38:52,571 INFO L226 Difference]: Without dead ends: 64324 [2019-09-07 19:38:52,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2019-09-07 19:38:52,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64324 states. [2019-09-07 19:38:55,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64324 to 62600. [2019-09-07 19:38:55,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62600 states. [2019-09-07 19:38:55,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62600 states to 62600 states and 88433 transitions. [2019-09-07 19:38:55,508 INFO L78 Accepts]: Start accepts. Automaton has 62600 states and 88433 transitions. Word has length 177 [2019-09-07 19:38:55,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:38:55,509 INFO L475 AbstractCegarLoop]: Abstraction has 62600 states and 88433 transitions. [2019-09-07 19:38:55,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:38:55,510 INFO L276 IsEmpty]: Start isEmpty. Operand 62600 states and 88433 transitions. [2019-09-07 19:38:55,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-07 19:38:55,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:38:55,515 INFO L399 BasicCegarLoop]: trace histogram [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, 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] [2019-09-07 19:38:55,515 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:38:55,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:38:55,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1941571349, now seen corresponding path program 1 times [2019-09-07 19:38:55,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:38:55,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:38:55,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:55,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:55,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:38:55,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:38:55,738 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:38:55,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:55,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:38:55,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:38:55,959 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:38:55,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:38:55,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:38:55,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:38:55,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:38:55,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:38:55,973 INFO L87 Difference]: Start difference. First operand 62600 states and 88433 transitions. Second operand 9 states. [2019-09-07 19:39:03,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:39:03,840 INFO L93 Difference]: Finished difference Result 125863 states and 184714 transitions. [2019-09-07 19:39:03,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:39:03,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 209 [2019-09-07 19:39:03,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:39:04,140 INFO L225 Difference]: With dead ends: 125863 [2019-09-07 19:39:04,140 INFO L226 Difference]: Without dead ends: 63269 [2019-09-07 19:39:04,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-09-07 19:39:04,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63269 states. [2019-09-07 19:39:05,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63269 to 63079. [2019-09-07 19:39:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63079 states. [2019-09-07 19:39:06,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63079 states to 63079 states and 82494 transitions. [2019-09-07 19:39:06,011 INFO L78 Accepts]: Start accepts. Automaton has 63079 states and 82494 transitions. Word has length 209 [2019-09-07 19:39:06,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:39:06,011 INFO L475 AbstractCegarLoop]: Abstraction has 63079 states and 82494 transitions. [2019-09-07 19:39:06,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:39:06,012 INFO L276 IsEmpty]: Start isEmpty. Operand 63079 states and 82494 transitions. [2019-09-07 19:39:06,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-07 19:39:06,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:39:06,025 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 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-09-07 19:39:06,025 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:39:06,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:39:06,026 INFO L82 PathProgramCache]: Analyzing trace with hash 731043971, now seen corresponding path program 1 times [2019-09-07 19:39:06,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:39:06,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:39:06,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:39:06,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:39:06,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:39:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:39:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 38 proven. 151 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-07 19:39:06,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:39:06,373 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:39:06,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:39:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:39:06,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:39:06,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:39:06,554 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-09-07 19:39:06,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:39:06,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-07 19:39:06,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:39:06,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:39:06,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:39:06,573 INFO L87 Difference]: Start difference. First operand 63079 states and 82494 transitions. Second operand 9 states. [2019-09-07 19:39:21,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:39:21,867 INFO L93 Difference]: Finished difference Result 153490 states and 198101 transitions. [2019-09-07 19:39:21,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 19:39:21,867 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 261 [2019-09-07 19:39:21,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:39:22,159 INFO L225 Difference]: With dead ends: 153490 [2019-09-07 19:39:22,159 INFO L226 Difference]: Without dead ends: 89605 [2019-09-07 19:39:22,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 270 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-09-07 19:39:22,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89605 states. [2019-09-07 19:39:25,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89605 to 67910. [2019-09-07 19:39:25,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67910 states. [2019-09-07 19:39:25,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67910 states to 67910 states and 81727 transitions. [2019-09-07 19:39:25,476 INFO L78 Accepts]: Start accepts. Automaton has 67910 states and 81727 transitions. Word has length 261 [2019-09-07 19:39:25,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:39:25,477 INFO L475 AbstractCegarLoop]: Abstraction has 67910 states and 81727 transitions. [2019-09-07 19:39:25,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:39:25,477 INFO L276 IsEmpty]: Start isEmpty. Operand 67910 states and 81727 transitions. [2019-09-07 19:39:25,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-07 19:39:25,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:39:25,487 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 19:39:25,487 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:39:25,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:39:25,488 INFO L82 PathProgramCache]: Analyzing trace with hash 390083225, now seen corresponding path program 1 times [2019-09-07 19:39:25,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:39:25,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:39:25,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:39:25,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:39:25,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:39:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:39:25,727 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 130 proven. 69 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-07 19:39:25,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:39:25,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:39:25,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:39:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:39:25,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 19:39:25,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:39:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-07 19:39:25,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:39:25,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:39:25,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:39:25,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:39:25,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:39:25,965 INFO L87 Difference]: Start difference. First operand 67910 states and 81727 transitions. Second operand 9 states. [2019-09-07 19:39:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:39:52,735 INFO L93 Difference]: Finished difference Result 211337 states and 273304 transitions. [2019-09-07 19:39:52,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 19:39:52,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 298 [2019-09-07 19:39:52,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:39:53,057 INFO L225 Difference]: With dead ends: 211337 [2019-09-07 19:39:53,057 INFO L226 Difference]: Without dead ends: 143433 [2019-09-07 19:39:53,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=403, Invalid=1853, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 19:39:53,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143433 states. [2019-09-07 19:39:54,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143433 to 141602. [2019-09-07 19:39:54,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141602 states. [2019-09-07 19:39:58,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141602 states to 141602 states and 172499 transitions. [2019-09-07 19:39:58,549 INFO L78 Accepts]: Start accepts. Automaton has 141602 states and 172499 transitions. Word has length 298 [2019-09-07 19:39:58,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:39:58,549 INFO L475 AbstractCegarLoop]: Abstraction has 141602 states and 172499 transitions. [2019-09-07 19:39:58,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:39:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand 141602 states and 172499 transitions. [2019-09-07 19:39:58,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-09-07 19:39:58,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:39:58,568 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 19:39:58,569 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:39:58,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:39:58,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1235885310, now seen corresponding path program 1 times [2019-09-07 19:39:58,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:39:58,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:39:58,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:39:58,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:39:58,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:39:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:39:58,824 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-07 19:39:58,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:39:58,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:39:58,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:39:58,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:39:58,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:39:58,826 INFO L87 Difference]: Start difference. First operand 141602 states and 172499 transitions. Second operand 4 states. [2019-09-07 19:40:09,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:40:09,168 INFO L93 Difference]: Finished difference Result 338035 states and 415426 transitions. [2019-09-07 19:40:09,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:40:09,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 381 [2019-09-07 19:40:09,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:40:09,669 INFO L225 Difference]: With dead ends: 338035 [2019-09-07 19:40:09,669 INFO L226 Difference]: Without dead ends: 197242 [2019-09-07 19:40:09,869 INFO L628 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-09-07 19:40:10,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197242 states. [2019-09-07 19:40:15,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197242 to 183173. [2019-09-07 19:40:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183173 states. [2019-09-07 19:40:16,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183173 states to 183173 states and 220431 transitions. [2019-09-07 19:40:16,180 INFO L78 Accepts]: Start accepts. Automaton has 183173 states and 220431 transitions. Word has length 381 [2019-09-07 19:40:16,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:40:16,181 INFO L475 AbstractCegarLoop]: Abstraction has 183173 states and 220431 transitions. [2019-09-07 19:40:16,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:40:16,181 INFO L276 IsEmpty]: Start isEmpty. Operand 183173 states and 220431 transitions. [2019-09-07 19:40:16,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-09-07 19:40:16,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:40:16,223 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:40:16,223 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:40:16,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:40:16,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1603689774, now seen corresponding path program 1 times [2019-09-07 19:40:16,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:40:16,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:40:16,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:40:16,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:40:16,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:40:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:40:16,575 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-09-07 19:40:16,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:40:16,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:40:16,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:40:16,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:40:16,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:40:16,577 INFO L87 Difference]: Start difference. First operand 183173 states and 220431 transitions. Second operand 3 states. [2019-09-07 19:40:24,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:40:24,757 INFO L93 Difference]: Finished difference Result 400804 states and 485155 transitions. [2019-09-07 19:40:24,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:40:24,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 526 [2019-09-07 19:40:24,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:40:25,267 INFO L225 Difference]: With dead ends: 400804 [2019-09-07 19:40:25,267 INFO L226 Difference]: Without dead ends: 218440 [2019-09-07 19:40:25,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:40:25,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218440 states. [2019-09-07 19:40:32,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218440 to 216761. [2019-09-07 19:40:32,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216761 states. [2019-09-07 19:40:32,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216761 states to 216761 states and 258823 transitions. [2019-09-07 19:40:32,501 INFO L78 Accepts]: Start accepts. Automaton has 216761 states and 258823 transitions. Word has length 526 [2019-09-07 19:40:32,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:40:32,502 INFO L475 AbstractCegarLoop]: Abstraction has 216761 states and 258823 transitions. [2019-09-07 19:40:32,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:40:32,502 INFO L276 IsEmpty]: Start isEmpty. Operand 216761 states and 258823 transitions. [2019-09-07 19:40:32,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 726 [2019-09-07 19:40:32,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:40:32,580 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:40:32,580 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:40:32,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:40:32,581 INFO L82 PathProgramCache]: Analyzing trace with hash 263673337, now seen corresponding path program 1 times [2019-09-07 19:40:32,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:40:32,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:40:32,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:40:32,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:40:32,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:40:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:40:33,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1159 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2019-09-07 19:40:33,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:40:33,901 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:40:33,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:40:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:40:34,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 1090 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:40:34,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:40:34,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1159 backedges. 843 proven. 2 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-09-07 19:40:34,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:40:34,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:40:34,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:40:34,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:40:34,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:40:34,498 INFO L87 Difference]: Start difference. First operand 216761 states and 258823 transitions. Second operand 9 states. [2019-09-07 19:40:49,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:40:49,400 INFO L93 Difference]: Finished difference Result 457767 states and 581600 transitions. [2019-09-07 19:40:49,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 19:40:49,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 725 [2019-09-07 19:40:49,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:40:50,141 INFO L225 Difference]: With dead ends: 457767 [2019-09-07 19:40:50,141 INFO L226 Difference]: Without dead ends: 241815 [2019-09-07 19:40:50,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 729 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-09-07 19:40:50,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241815 states. [2019-09-07 19:40:59,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241815 to 235933. [2019-09-07 19:40:59,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235933 states. [2019-09-07 19:40:59,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235933 states to 235933 states and 293818 transitions. [2019-09-07 19:40:59,954 INFO L78 Accepts]: Start accepts. Automaton has 235933 states and 293818 transitions. Word has length 725 [2019-09-07 19:40:59,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:40:59,955 INFO L475 AbstractCegarLoop]: Abstraction has 235933 states and 293818 transitions. [2019-09-07 19:40:59,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:40:59,955 INFO L276 IsEmpty]: Start isEmpty. Operand 235933 states and 293818 transitions. [2019-09-07 19:41:00,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2019-09-07 19:41:00,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:41:00,160 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 19:41:00,160 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:41:00,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:41:00,161 INFO L82 PathProgramCache]: Analyzing trace with hash -428780663, now seen corresponding path program 1 times [2019-09-07 19:41:00,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:41:00,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:41:00,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:41:00,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:41:00,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:41:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:41:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 322 proven. 134 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2019-09-07 19:41:01,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:41:01,611 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:41:01,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:41:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:41:01,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:41:01,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:41:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 671 proven. 2 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2019-09-07 19:41:02,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:41:02,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:41:02,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:41:02,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:41:02,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:41:02,612 INFO L87 Difference]: Start difference. First operand 235933 states and 293818 transitions. Second operand 9 states. [2019-09-07 19:41:25,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:41:25,045 INFO L93 Difference]: Finished difference Result 502894 states and 665526 transitions. [2019-09-07 19:41:25,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 19:41:25,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 760 [2019-09-07 19:41:25,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:41:25,915 INFO L225 Difference]: With dead ends: 502894 [2019-09-07 19:41:25,915 INFO L226 Difference]: Without dead ends: 266949 [2019-09-07 19:41:26,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 783 GetRequests, 767 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 19:41:26,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266949 states. [2019-09-07 19:41:33,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266949 to 264980. [2019-09-07 19:41:33,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264980 states. [2019-09-07 19:41:35,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264980 states to 264980 states and 343666 transitions. [2019-09-07 19:41:35,281 INFO L78 Accepts]: Start accepts. Automaton has 264980 states and 343666 transitions. Word has length 760 [2019-09-07 19:41:35,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:41:35,281 INFO L475 AbstractCegarLoop]: Abstraction has 264980 states and 343666 transitions. [2019-09-07 19:41:35,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:41:35,282 INFO L276 IsEmpty]: Start isEmpty. Operand 264980 states and 343666 transitions. [2019-09-07 19:41:35,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2019-09-07 19:41:35,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:41:35,447 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 19:41:35,447 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:41:35,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:41:35,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1726224499, now seen corresponding path program 1 times [2019-09-07 19:41:35,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:41:35,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:41:35,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:41:35,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:41:35,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:41:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:41:39,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1507 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 1392 trivial. 0 not checked. [2019-09-07 19:41:39,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:41:39,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:41:39,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:41:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:41:40,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 1186 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 19:41:40,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:41:40,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1507 backedges. 861 proven. 0 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2019-09-07 19:41:40,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:41:40,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-09-07 19:41:40,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:41:40,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:41:40,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:41:40,476 INFO L87 Difference]: Start difference. First operand 264980 states and 343666 transitions. Second operand 4 states. [2019-09-07 19:41:47,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:41:47,765 INFO L93 Difference]: Finished difference Result 513521 states and 669079 transitions. [2019-09-07 19:41:47,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:41:47,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 784 [2019-09-07 19:41:47,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:41:48,604 INFO L225 Difference]: With dead ends: 513521 [2019-09-07 19:41:48,604 INFO L226 Difference]: Without dead ends: 263238 [2019-09-07 19:41:49,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 787 GetRequests, 785 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:41:49,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263238 states. [2019-09-07 19:41:54,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263238 to 263237. [2019-09-07 19:41:54,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263237 states. [2019-09-07 19:41:56,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263237 states to 263237 states and 340388 transitions. [2019-09-07 19:41:56,402 INFO L78 Accepts]: Start accepts. Automaton has 263237 states and 340388 transitions. Word has length 784 [2019-09-07 19:41:56,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:41:56,402 INFO L475 AbstractCegarLoop]: Abstraction has 263237 states and 340388 transitions. [2019-09-07 19:41:56,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:41:56,403 INFO L276 IsEmpty]: Start isEmpty. Operand 263237 states and 340388 transitions. [2019-09-07 19:41:56,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 803 [2019-09-07 19:41:56,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:41:56,557 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:41:56,557 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:41:56,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:41:56,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1880014465, now seen corresponding path program 1 times [2019-09-07 19:41:56,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:41:56,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:41:56,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:41:56,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:41:56,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:41:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:42:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 496 proven. 492 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-09-07 19:42:01,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:42:01,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:42:01,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:42:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:42:02,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 1201 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:42:02,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:42:02,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 1061 proven. 2 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-09-07 19:42:02,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:42:02,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-09-07 19:42:02,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 19:42:02,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 19:42:02,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-07 19:42:02,744 INFO L87 Difference]: Start difference. First operand 263237 states and 340388 transitions. Second operand 12 states. [2019-09-07 19:42:16,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:42:16,453 INFO L93 Difference]: Finished difference Result 506621 states and 658616 transitions. [2019-09-07 19:42:16,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 19:42:16,454 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 802 [2019-09-07 19:42:16,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:42:17,202 INFO L225 Difference]: With dead ends: 506621 [2019-09-07 19:42:17,202 INFO L226 Difference]: Without dead ends: 253085 [2019-09-07 19:42:17,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 810 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-09-07 19:42:17,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253085 states. [2019-09-07 19:42:27,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253085 to 221956. [2019-09-07 19:42:27,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221956 states. [2019-09-07 19:42:28,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221956 states to 221956 states and 283653 transitions. [2019-09-07 19:42:28,039 INFO L78 Accepts]: Start accepts. Automaton has 221956 states and 283653 transitions. Word has length 802 [2019-09-07 19:42:28,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:42:28,040 INFO L475 AbstractCegarLoop]: Abstraction has 221956 states and 283653 transitions. [2019-09-07 19:42:28,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 19:42:28,040 INFO L276 IsEmpty]: Start isEmpty. Operand 221956 states and 283653 transitions. [2019-09-07 19:42:28,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2019-09-07 19:42:28,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:42:28,207 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 19:42:28,207 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:42:28,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:42:28,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1533837753, now seen corresponding path program 1 times [2019-09-07 19:42:28,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:42:28,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:42:28,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:42:28,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:42:28,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:42:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:42:29,581 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 359 proven. 2 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-09-07 19:42:29,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:42:29,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:42:29,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:42:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:42:29,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 1149 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 19:42:29,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:42:29,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:42:30,506 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2019-09-07 19:42:30,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:42:30,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:42:30,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:42:30,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:42:30,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:42:30,515 INFO L87 Difference]: Start difference. First operand 221956 states and 283653 transitions. Second operand 9 states. [2019-09-07 19:42:53,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:42:53,631 INFO L93 Difference]: Finished difference Result 508275 states and 647577 transitions. [2019-09-07 19:42:53,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 19:42:53,631 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 807 [2019-09-07 19:42:53,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:42:54,577 INFO L225 Difference]: With dead ends: 508275 [2019-09-07 19:42:54,577 INFO L226 Difference]: Without dead ends: 287128 [2019-09-07 19:42:54,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 860 GetRequests, 829 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=835, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 19:42:55,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287128 states. [2019-09-07 19:42:59,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287128 to 278745. [2019-09-07 19:42:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278745 states. [2019-09-07 19:43:01,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278745 states to 278745 states and 322276 transitions. [2019-09-07 19:43:01,425 INFO L78 Accepts]: Start accepts. Automaton has 278745 states and 322276 transitions. Word has length 807 [2019-09-07 19:43:01,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:43:01,425 INFO L475 AbstractCegarLoop]: Abstraction has 278745 states and 322276 transitions. [2019-09-07 19:43:01,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:43:01,426 INFO L276 IsEmpty]: Start isEmpty. Operand 278745 states and 322276 transitions. [2019-09-07 19:43:01,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1001 [2019-09-07 19:43:01,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:43:01,551 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 19:43:01,551 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:43:01,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:43:01,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1129812851, now seen corresponding path program 1 times [2019-09-07 19:43:01,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:43:01,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:43:01,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:43:01,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:43:01,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:43:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:43:08,161 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 127 proven. 514 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-09-07 19:43:08,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:43:08,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:43:08,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:43:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:43:08,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 1361 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 19:43:08,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:43:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 419 proven. 2 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-09-07 19:43:08,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:43:08,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-09-07 19:43:08,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 19:43:08,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 19:43:08,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-07 19:43:08,953 INFO L87 Difference]: Start difference. First operand 278745 states and 322276 transitions. Second operand 13 states. [2019-09-07 19:43:38,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:43:38,323 INFO L93 Difference]: Finished difference Result 588811 states and 700246 transitions. [2019-09-07 19:43:38,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-07 19:43:38,323 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1000 [2019-09-07 19:43:38,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:43:39,242 INFO L225 Difference]: With dead ends: 588811 [2019-09-07 19:43:39,242 INFO L226 Difference]: Without dead ends: 299614 [2019-09-07 19:43:39,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1144 GetRequests, 1064 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2331 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1066, Invalid=5414, Unknown=0, NotChecked=0, Total=6480 [2019-09-07 19:43:39,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299614 states. [2019-09-07 19:43:45,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299614 to 289358. [2019-09-07 19:43:45,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289358 states. [2019-09-07 19:43:45,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289358 states to 289358 states and 328556 transitions. [2019-09-07 19:43:45,841 INFO L78 Accepts]: Start accepts. Automaton has 289358 states and 328556 transitions. Word has length 1000 [2019-09-07 19:43:45,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:43:45,841 INFO L475 AbstractCegarLoop]: Abstraction has 289358 states and 328556 transitions. [2019-09-07 19:43:45,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 19:43:45,842 INFO L276 IsEmpty]: Start isEmpty. Operand 289358 states and 328556 transitions. [2019-09-07 19:43:45,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1026 [2019-09-07 19:43:45,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:43:45,953 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 19:43:45,953 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:43:45,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:43:45,953 INFO L82 PathProgramCache]: Analyzing trace with hash -701624228, now seen corresponding path program 1 times [2019-09-07 19:43:45,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:43:45,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:43:45,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:43:45,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:43:45,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:43:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:43:49,878 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 448 proven. 2 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2019-09-07 19:43:49,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:43:49,878 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:43:49,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:43:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:43:50,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 1392 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:43:50,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:43:50,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:43:54,584 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 501 proven. 2 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2019-09-07 19:43:54,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:43:54,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2019-09-07 19:43:54,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 19:43:54,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 19:43:54,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:43:54,590 INFO L87 Difference]: Start difference. First operand 289358 states and 328556 transitions. Second operand 11 states. [2019-09-07 19:44:42,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:44:42,851 INFO L93 Difference]: Finished difference Result 738530 states and 836517 transitions. [2019-09-07 19:44:42,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-07 19:44:42,852 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1025 [2019-09-07 19:44:42,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:44:44,920 INFO L225 Difference]: With dead ends: 738530 [2019-09-07 19:44:44,920 INFO L226 Difference]: Without dead ends: 449981 [2019-09-07 19:44:45,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1190 GetRequests, 1100 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3195 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1151, Invalid=7221, Unknown=0, NotChecked=0, Total=8372 [2019-09-07 19:44:45,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449981 states. [2019-09-07 19:44:57,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449981 to 422390. [2019-09-07 19:44:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422390 states. [2019-09-07 19:44:59,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422390 states to 422390 states and 473176 transitions. [2019-09-07 19:44:59,091 INFO L78 Accepts]: Start accepts. Automaton has 422390 states and 473176 transitions. Word has length 1025 [2019-09-07 19:44:59,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:44:59,092 INFO L475 AbstractCegarLoop]: Abstraction has 422390 states and 473176 transitions. [2019-09-07 19:44:59,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 19:44:59,092 INFO L276 IsEmpty]: Start isEmpty. Operand 422390 states and 473176 transitions. [2019-09-07 19:44:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1343 [2019-09-07 19:44:59,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:44:59,234 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 19:44:59,235 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:44:59,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:44:59,235 INFO L82 PathProgramCache]: Analyzing trace with hash 363263885, now seen corresponding path program 1 times [2019-09-07 19:44:59,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:44:59,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:44:59,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:44:59,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:44:59,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:44:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:45:05,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 314 proven. 214 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2019-09-07 19:45:05,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:45:05,329 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:45:05,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:45:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:45:05,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 1787 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 19:45:05,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:45:05,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:45:06,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 781 proven. 2 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-09-07 19:45:06,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:45:06,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 19:45:06,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 19:45:06,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 19:45:06,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-07 19:45:06,545 INFO L87 Difference]: Start difference. First operand 422390 states and 473176 transitions. Second operand 10 states. [2019-09-07 19:45:35,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:45:35,128 INFO L93 Difference]: Finished difference Result 852146 states and 953538 transitions. [2019-09-07 19:45:35,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 19:45:35,128 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1342 [2019-09-07 19:45:35,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:45:36,153 INFO L225 Difference]: With dead ends: 852146 [2019-09-07 19:45:36,153 INFO L226 Difference]: Without dead ends: 430565 [2019-09-07 19:45:36,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1440 GetRequests, 1386 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1021 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=549, Invalid=2531, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 19:45:36,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430565 states. [2019-09-07 19:45:44,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430565 to 423823. [2019-09-07 19:45:44,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423823 states. [2019-09-07 19:45:46,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423823 states to 423823 states and 462501 transitions. [2019-09-07 19:45:46,728 INFO L78 Accepts]: Start accepts. Automaton has 423823 states and 462501 transitions. Word has length 1342 [2019-09-07 19:45:46,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:45:46,729 INFO L475 AbstractCegarLoop]: Abstraction has 423823 states and 462501 transitions. [2019-09-07 19:45:46,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 19:45:46,730 INFO L276 IsEmpty]: Start isEmpty. Operand 423823 states and 462501 transitions. [2019-09-07 19:45:46,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1424 [2019-09-07 19:45:46,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:45:46,894 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 19:45:46,894 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:45:46,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:45:46,895 INFO L82 PathProgramCache]: Analyzing trace with hash 557722288, now seen corresponding path program 1 times [2019-09-07 19:45:46,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:45:46,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:45:46,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:45:46,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:45:46,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:45:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:46:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1504 backedges. 1327 proven. 16 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-09-07 19:46:02,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:46:02,370 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:46:02,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:46:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:46:02,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 1863 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 19:46:02,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:46:02,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:46:02,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:46:02,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:46:03,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:46:05,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:46:06,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1504 backedges. 1074 proven. 2 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2019-09-07 19:46:06,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:46:06,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 8] total 35 [2019-09-07 19:46:06,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 19:46:06,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 19:46:06,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1059, Unknown=1, NotChecked=0, Total=1190 [2019-09-07 19:46:06,444 INFO L87 Difference]: Start difference. First operand 423823 states and 462501 transitions. Second operand 35 states. [2019-09-07 19:46:06,657 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 23 [2019-09-07 19:46:07,744 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 38 [2019-09-07 19:46:12,736 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 40 [2019-09-07 19:46:13,117 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 35 [2019-09-07 19:46:25,406 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 50 [2019-09-07 19:46:28,989 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-09-07 19:46:29,195 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-07 19:46:32,837 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-07 19:46:41,315 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-07 19:46:41,917 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-07 19:46:42,479 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-07 19:46:42,687 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-07 19:46:45,112 WARN L188 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 64 DAG size of output: 30 [2019-09-07 19:46:56,815 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-07 19:46:59,479 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 40 [2019-09-07 19:47:00,486 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-07 19:47:00,848 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 41 [2019-09-07 19:47:07,562 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 37 [2019-09-07 19:47:13,898 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2019-09-07 19:47:17,052 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 58 [2019-09-07 19:47:25,002 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2019-09-07 19:47:30,833 WARN L188 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2019-09-07 19:47:40,677 WARN L188 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2019-09-07 19:47:50,220 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-07 19:47:53,698 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-07 19:47:55,797 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-07 19:47:57,378 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-07 19:47:57,599 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-07 19:47:57,887 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-07 19:47:58,176 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-07 19:47:59,979 WARN L188 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2019-09-07 19:48:02,270 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 74 DAG size of output: 41 [2019-09-07 19:48:05,961 WARN L188 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2019-09-07 19:48:07,575 WARN L188 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2019-09-07 19:48:13,722 WARN L188 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 105 DAG size of output: 57 [2019-09-07 19:48:23,625 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 55 [2019-09-07 19:48:26,402 WARN L188 SmtUtils]: Spent 924.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 41 [2019-09-07 19:48:26,672 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 37 [2019-09-07 19:48:27,237 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-09-07 19:48:31,770 WARN L188 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2019-09-07 19:48:35,893 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-07 19:48:55,419 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-07 19:48:59,586 WARN L188 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 54 [2019-09-07 19:49:03,205 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-07 19:49:03,619 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 32 [2019-09-07 19:49:06,603 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-07 19:49:07,362 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-09-07 19:49:07,732 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 50 [2019-09-07 19:49:08,501 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 33 [2019-09-07 19:49:11,531 WARN L188 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 39 [2019-09-07 19:49:17,423 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-07 19:49:22,592 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 34 [2019-09-07 19:49:27,556 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-09-07 19:49:27,861 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-09-07 19:49:30,833 WARN L188 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 108 DAG size of output: 50 [2019-09-07 19:49:31,136 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57