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/Problem16_label51.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 21:19:37,274 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 21:19:37,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 21:19:37,288 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 21:19:37,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 21:19:37,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 21:19:37,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 21:19:37,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 21:19:37,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 21:19:37,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 21:19:37,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 21:19:37,297 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 21:19:37,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 21:19:37,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 21:19:37,300 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 21:19:37,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 21:19:37,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 21:19:37,303 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 21:19:37,304 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 21:19:37,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 21:19:37,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 21:19:37,309 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 21:19:37,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 21:19:37,311 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 21:19:37,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 21:19:37,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 21:19:37,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 21:19:37,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 21:19:37,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 21:19:37,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 21:19:37,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 21:19:37,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 21:19:37,318 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 21:19:37,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 21:19:37,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 21:19:37,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 21:19:37,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 21:19:37,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 21:19:37,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 21:19:37,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 21:19:37,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 21:19:37,324 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 21:19:37,338 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 21:19:37,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 21:19:37,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 21:19:37,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 21:19:37,340 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 21:19:37,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 21:19:37,341 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 21:19:37,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 21:19:37,341 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 21:19:37,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 21:19:37,342 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 21:19:37,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 21:19:37,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 21:19:37,342 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 21:19:37,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 21:19:37,343 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 21:19:37,343 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 21:19:37,343 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 21:19:37,343 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 21:19:37,344 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 21:19:37,344 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 21:19:37,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 21:19:37,344 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 21:19:37,344 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 21:19:37,345 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 21:19:37,345 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 21:19:37,345 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 21:19:37,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 21:19:37,345 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 21:19:37,373 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 21:19:37,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 21:19:37,390 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 21:19:37,391 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 21:19:37,392 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 21:19:37,393 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label51.c [2019-09-07 21:19:37,452 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4bd3c1fe/595630e886db40ca80c2b21bbe8dd6eb/FLAG9e6c42420 [2019-09-07 21:19:38,105 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 21:19:38,106 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label51.c [2019-09-07 21:19:38,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4bd3c1fe/595630e886db40ca80c2b21bbe8dd6eb/FLAG9e6c42420 [2019-09-07 21:19:38,251 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4bd3c1fe/595630e886db40ca80c2b21bbe8dd6eb [2019-09-07 21:19:38,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 21:19:38,263 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 21:19:38,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 21:19:38,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 21:19:38,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 21:19:38,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:19:38" (1/1) ... [2019-09-07 21:19:38,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11da6c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:38, skipping insertion in model container [2019-09-07 21:19:38,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:19:38" (1/1) ... [2019-09-07 21:19:38,279 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 21:19:38,362 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 21:19:39,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:19:39,209 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 21:19:39,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:19:39,462 INFO L192 MainTranslator]: Completed translation [2019-09-07 21:19:39,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:39 WrapperNode [2019-09-07 21:19:39,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 21:19:39,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 21:19:39,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 21:19:39,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 21:19:39,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:39" (1/1) ... [2019-09-07 21:19:39,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:39" (1/1) ... [2019-09-07 21:19:39,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:39" (1/1) ... [2019-09-07 21:19:39,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:39" (1/1) ... [2019-09-07 21:19:39,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:39" (1/1) ... [2019-09-07 21:19:39,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:39" (1/1) ... [2019-09-07 21:19:39,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:39" (1/1) ... [2019-09-07 21:19:39,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 21:19:39,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 21:19:39,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 21:19:39,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 21:19:39,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:39" (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 21:19:39,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 21:19:39,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 21:19:39,730 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 21:19:39,730 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 21:19:39,731 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 21:19:39,732 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 21:19:39,732 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 21:19:39,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 21:19:39,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 21:19:39,734 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 21:19:39,734 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 21:19:39,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 21:19:39,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 21:19:42,408 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 21:19:42,409 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 21:19:42,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:19:42 BoogieIcfgContainer [2019-09-07 21:19:42,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 21:19:42,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 21:19:42,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 21:19:42,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 21:19:42,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 09:19:38" (1/3) ... [2019-09-07 21:19:42,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b87fa1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:19:42, skipping insertion in model container [2019-09-07 21:19:42,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:39" (2/3) ... [2019-09-07 21:19:42,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b87fa1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:19:42, skipping insertion in model container [2019-09-07 21:19:42,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:19:42" (3/3) ... [2019-09-07 21:19:42,419 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label51.c [2019-09-07 21:19:42,429 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 21:19:42,438 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 21:19:42,456 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 21:19:42,492 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 21:19:42,492 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 21:19:42,493 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 21:19:42,493 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 21:19:42,493 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 21:19:42,493 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 21:19:42,493 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 21:19:42,493 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 21:19:42,494 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 21:19:42,526 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states. [2019-09-07 21:19:42,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 21:19:42,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:19:42,533 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 21:19:42,535 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:19:42,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:19:42,542 INFO L82 PathProgramCache]: Analyzing trace with hash 848957365, now seen corresponding path program 1 times [2019-09-07 21:19:42,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:19:42,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:19:42,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:19:42,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:19:42,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:19:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:19:42,758 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 21:19:42,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:19:42,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 21:19:42,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 21:19:42,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 21:19:42,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:19:42,784 INFO L87 Difference]: Start difference. First operand 409 states. Second operand 3 states. [2019-09-07 21:19:45,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:19:45,775 INFO L93 Difference]: Finished difference Result 1153 states and 2141 transitions. [2019-09-07 21:19:45,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 21:19:45,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-07 21:19:45,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:19:45,799 INFO L225 Difference]: With dead ends: 1153 [2019-09-07 21:19:45,799 INFO L226 Difference]: Without dead ends: 682 [2019-09-07 21:19:45,811 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 21:19:45,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-09-07 21:19:45,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2019-09-07 21:19:45,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-09-07 21:19:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1184 transitions. [2019-09-07 21:19:45,920 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1184 transitions. Word has length 20 [2019-09-07 21:19:45,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:19:45,921 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 1184 transitions. [2019-09-07 21:19:45,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 21:19:45,921 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1184 transitions. [2019-09-07 21:19:45,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-07 21:19:45,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:19:45,926 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 21:19:45,927 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:19:45,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:19:45,927 INFO L82 PathProgramCache]: Analyzing trace with hash -998281719, now seen corresponding path program 1 times [2019-09-07 21:19:45,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:19:45,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:19:45,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:19:45,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:19:45,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:19:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:19:46,200 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 21:19:46,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:19:46,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 21:19:46,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 21:19:46,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 21:19:46,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 21:19:46,204 INFO L87 Difference]: Start difference. First operand 682 states and 1184 transitions. Second operand 5 states. [2019-09-07 21:19:49,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:19:49,105 INFO L93 Difference]: Finished difference Result 2066 states and 3624 transitions. [2019-09-07 21:19:49,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:19:49,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-07 21:19:49,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:19:49,129 INFO L225 Difference]: With dead ends: 2066 [2019-09-07 21:19:49,130 INFO L226 Difference]: Without dead ends: 1390 [2019-09-07 21:19:49,137 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 21:19:49,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-09-07 21:19:49,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1372. [2019-09-07 21:19:49,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-09-07 21:19:49,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 2268 transitions. [2019-09-07 21:19:49,243 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 2268 transitions. Word has length 89 [2019-09-07 21:19:49,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:19:49,244 INFO L475 AbstractCegarLoop]: Abstraction has 1372 states and 2268 transitions. [2019-09-07 21:19:49,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 21:19:49,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2268 transitions. [2019-09-07 21:19:49,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-07 21:19:49,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:19:49,249 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] [2019-09-07 21:19:49,250 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:19:49,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:19:49,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1910769444, now seen corresponding path program 1 times [2019-09-07 21:19:49,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:19:49,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:19:49,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:19:49,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:19:49,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:19:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:19:49,495 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 21:19:49,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:19:49,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 21:19:49,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:19:49,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:19:49,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:19:49,501 INFO L87 Difference]: Start difference. First operand 1372 states and 2268 transitions. Second operand 6 states. [2019-09-07 21:19:52,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:19:52,181 INFO L93 Difference]: Finished difference Result 3472 states and 5791 transitions. [2019-09-07 21:19:52,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:19:52,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-09-07 21:19:52,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:19:52,200 INFO L225 Difference]: With dead ends: 3472 [2019-09-07 21:19:52,200 INFO L226 Difference]: Without dead ends: 2106 [2019-09-07 21:19:52,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:19:52,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2019-09-07 21:19:52,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 2081. [2019-09-07 21:19:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2019-09-07 21:19:52,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 3263 transitions. [2019-09-07 21:19:52,297 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 3263 transitions. Word has length 118 [2019-09-07 21:19:52,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:19:52,306 INFO L475 AbstractCegarLoop]: Abstraction has 2081 states and 3263 transitions. [2019-09-07 21:19:52,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:19:52,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 3263 transitions. [2019-09-07 21:19:52,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-07 21:19:52,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:19:52,312 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] [2019-09-07 21:19:52,313 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:19:52,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:19:52,319 INFO L82 PathProgramCache]: Analyzing trace with hash -734488488, now seen corresponding path program 1 times [2019-09-07 21:19:52,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:19:52,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:19:52,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:19:52,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:19:52,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:19:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:19:52,469 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 21:19:52,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:19:52,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 21:19:52,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:19:52,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:19:52,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:19:52,471 INFO L87 Difference]: Start difference. First operand 2081 states and 3263 transitions. Second operand 6 states. [2019-09-07 21:19:55,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:19:55,263 INFO L93 Difference]: Finished difference Result 5241 states and 8253 transitions. [2019-09-07 21:19:55,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:19:55,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-09-07 21:19:55,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:19:55,287 INFO L225 Difference]: With dead ends: 5241 [2019-09-07 21:19:55,288 INFO L226 Difference]: Without dead ends: 3166 [2019-09-07 21:19:55,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:19:55,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3166 states. [2019-09-07 21:19:55,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3166 to 3140. [2019-09-07 21:19:55,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2019-09-07 21:19:55,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 4128 transitions. [2019-09-07 21:19:55,391 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 4128 transitions. Word has length 136 [2019-09-07 21:19:55,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:19:55,393 INFO L475 AbstractCegarLoop]: Abstraction has 3140 states and 4128 transitions. [2019-09-07 21:19:55,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:19:55,393 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 4128 transitions. [2019-09-07 21:19:55,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-07 21:19:55,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:19:55,402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:19:55,402 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:19:55,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:19:55,402 INFO L82 PathProgramCache]: Analyzing trace with hash 292028781, now seen corresponding path program 1 times [2019-09-07 21:19:55,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:19:55,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:19:55,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:19:55,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:19:55,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:19:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:19:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 21:19:55,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:19:55,663 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 21:19:55,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:19:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:19:55,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:19:55,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:19:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 21:19:55,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:19:55,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-07 21:19:55,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:19:55,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:19:55,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:19:55,949 INFO L87 Difference]: Start difference. First operand 3140 states and 4128 transitions. Second operand 6 states. [2019-09-07 21:19:59,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:19:59,531 INFO L93 Difference]: Finished difference Result 8017 states and 10600 transitions. [2019-09-07 21:19:59,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:19:59,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 218 [2019-09-07 21:19:59,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:19:59,565 INFO L225 Difference]: With dead ends: 8017 [2019-09-07 21:19:59,565 INFO L226 Difference]: Without dead ends: 4883 [2019-09-07 21:19:59,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-07 21:19:59,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4883 states. [2019-09-07 21:19:59,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4883 to 4518. [2019-09-07 21:19:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4518 states. [2019-09-07 21:19:59,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4518 states to 4518 states and 5824 transitions. [2019-09-07 21:19:59,748 INFO L78 Accepts]: Start accepts. Automaton has 4518 states and 5824 transitions. Word has length 218 [2019-09-07 21:19:59,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:19:59,749 INFO L475 AbstractCegarLoop]: Abstraction has 4518 states and 5824 transitions. [2019-09-07 21:19:59,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:19:59,749 INFO L276 IsEmpty]: Start isEmpty. Operand 4518 states and 5824 transitions. [2019-09-07 21:19:59,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-09-07 21:19:59,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:19:59,757 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, 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] [2019-09-07 21:19:59,758 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:19:59,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:19:59,758 INFO L82 PathProgramCache]: Analyzing trace with hash 2071652308, now seen corresponding path program 1 times [2019-09-07 21:19:59,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:19:59,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:19:59,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:19:59,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:19:59,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:19:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 156 proven. 115 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-07 21:20:00,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:20:00,150 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 21:20:00,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:00,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:20:00,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:20:00,470 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 369 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-07 21:20:00,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:20:00,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 21:20:00,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:20:00,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:20:00,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:20:00,486 INFO L87 Difference]: Start difference. First operand 4518 states and 5824 transitions. Second operand 9 states. [2019-09-07 21:20:06,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:20:06,477 INFO L93 Difference]: Finished difference Result 11940 states and 15954 transitions. [2019-09-07 21:20:06,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 21:20:06,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 380 [2019-09-07 21:20:06,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:20:06,524 INFO L225 Difference]: With dead ends: 11940 [2019-09-07 21:20:06,524 INFO L226 Difference]: Without dead ends: 7428 [2019-09-07 21:20:06,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-09-07 21:20:06,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7428 states. [2019-09-07 21:20:06,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7428 to 7386. [2019-09-07 21:20:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7386 states. [2019-09-07 21:20:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7386 states to 7386 states and 9380 transitions. [2019-09-07 21:20:06,780 INFO L78 Accepts]: Start accepts. Automaton has 7386 states and 9380 transitions. Word has length 380 [2019-09-07 21:20:06,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:20:06,782 INFO L475 AbstractCegarLoop]: Abstraction has 7386 states and 9380 transitions. [2019-09-07 21:20:06,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:20:06,783 INFO L276 IsEmpty]: Start isEmpty. Operand 7386 states and 9380 transitions. [2019-09-07 21:20:06,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2019-09-07 21:20:06,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:20:06,827 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 21:20:06,828 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:20:06,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:20:06,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1375328674, now seen corresponding path program 1 times [2019-09-07 21:20:06,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:20:06,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:20:06,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:06,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:06,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:07,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1117 backedges. 65 proven. 455 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2019-09-07 21:20:07,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:20:07,683 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 21:20:07,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:07,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 1017 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 21:20:07,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:20:08,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1117 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2019-09-07 21:20:08,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:20:08,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 21:20:08,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:20:08,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:20:08,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:20:08,188 INFO L87 Difference]: Start difference. First operand 7386 states and 9380 transitions. Second operand 9 states. [2019-09-07 21:20:12,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:20:12,323 INFO L93 Difference]: Finished difference Result 14829 states and 18979 transitions. [2019-09-07 21:20:12,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 21:20:12,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 710 [2019-09-07 21:20:12,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:20:12,377 INFO L225 Difference]: With dead ends: 14829 [2019-09-07 21:20:12,377 INFO L226 Difference]: Without dead ends: 7449 [2019-09-07 21:20:12,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 718 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2019-09-07 21:20:12,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7449 states. [2019-09-07 21:20:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7449 to 7426. [2019-09-07 21:20:12,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7426 states. [2019-09-07 21:20:12,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7426 states to 7426 states and 9114 transitions. [2019-09-07 21:20:12,653 INFO L78 Accepts]: Start accepts. Automaton has 7426 states and 9114 transitions. Word has length 710 [2019-09-07 21:20:12,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:20:12,654 INFO L475 AbstractCegarLoop]: Abstraction has 7426 states and 9114 transitions. [2019-09-07 21:20:12,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:20:12,654 INFO L276 IsEmpty]: Start isEmpty. Operand 7426 states and 9114 transitions. [2019-09-07 21:20:12,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 741 [2019-09-07 21:20:12,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:20:12,699 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 21:20:12,700 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:20:12,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:20:12,700 INFO L82 PathProgramCache]: Analyzing trace with hash 830851578, now seen corresponding path program 1 times [2019-09-07 21:20:12,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:20:12,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:20:12,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:12,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:12,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:13,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1117 backedges. 489 proven. 2 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2019-09-07 21:20:13,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:20:13,502 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 21:20:13,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:13,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:20:13,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:20:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1117 backedges. 489 proven. 2 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2019-09-07 21:20:14,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:20:14,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 21:20:14,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:20:14,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:20:14,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:20:14,135 INFO L87 Difference]: Start difference. First operand 7426 states and 9114 transitions. Second operand 9 states. [2019-09-07 21:20:18,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:20:18,162 INFO L93 Difference]: Finished difference Result 14095 states and 17128 transitions. [2019-09-07 21:20:18,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 21:20:18,163 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 740 [2019-09-07 21:20:18,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:20:18,183 INFO L225 Difference]: With dead ends: 14095 [2019-09-07 21:20:18,184 INFO L226 Difference]: Without dead ends: 6675 [2019-09-07 21:20:18,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 744 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-09-07 21:20:18,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6675 states. [2019-09-07 21:20:18,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6675 to 6650. [2019-09-07 21:20:18,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6650 states. [2019-09-07 21:20:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6650 states to 6650 states and 7694 transitions. [2019-09-07 21:20:18,321 INFO L78 Accepts]: Start accepts. Automaton has 6650 states and 7694 transitions. Word has length 740 [2019-09-07 21:20:18,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:20:18,322 INFO L475 AbstractCegarLoop]: Abstraction has 6650 states and 7694 transitions. [2019-09-07 21:20:18,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:20:18,322 INFO L276 IsEmpty]: Start isEmpty. Operand 6650 states and 7694 transitions. [2019-09-07 21:20:18,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2019-09-07 21:20:18,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:20:18,365 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, 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, 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] [2019-09-07 21:20:18,365 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:20:18,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:20:18,366 INFO L82 PathProgramCache]: Analyzing trace with hash 333704866, now seen corresponding path program 1 times [2019-09-07 21:20:18,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:20:18,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:20:18,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:18,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:18,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:19,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1153 backedges. 745 proven. 124 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-09-07 21:20:19,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:20:19,320 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) [2019-09-07 21:20:19,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:20:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:19,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:20:19,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:20:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1153 backedges. 525 proven. 2 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2019-09-07 21:20:19,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:20:19,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 21:20:19,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:20:19,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:20:19,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:20:19,803 INFO L87 Difference]: Start difference. First operand 6650 states and 7694 transitions. Second operand 9 states. [2019-09-07 21:20:24,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:20:24,951 INFO L93 Difference]: Finished difference Result 18481 states and 21604 transitions. [2019-09-07 21:20:24,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 21:20:24,952 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 752 [2019-09-07 21:20:24,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:20:25,000 INFO L225 Difference]: With dead ends: 18481 [2019-09-07 21:20:25,000 INFO L226 Difference]: Without dead ends: 10037 [2019-09-07 21:20:25,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 760 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-09-07 21:20:25,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10037 states. [2019-09-07 21:20:25,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10037 to 9630. [2019-09-07 21:20:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9630 states. [2019-09-07 21:20:25,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9630 states to 9630 states and 10195 transitions. [2019-09-07 21:20:25,419 INFO L78 Accepts]: Start accepts. Automaton has 9630 states and 10195 transitions. Word has length 752 [2019-09-07 21:20:25,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:20:25,421 INFO L475 AbstractCegarLoop]: Abstraction has 9630 states and 10195 transitions. [2019-09-07 21:20:25,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:20:25,421 INFO L276 IsEmpty]: Start isEmpty. Operand 9630 states and 10195 transitions. [2019-09-07 21:20:25,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1030 [2019-09-07 21:20:25,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:20:25,457 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:20:25,458 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:20:25,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:20:25,458 INFO L82 PathProgramCache]: Analyzing trace with hash 817357204, now seen corresponding path program 1 times [2019-09-07 21:20:25,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:20:25,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:20:25,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:25,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:25,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:26,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1826 backedges. 316 proven. 392 refuted. 0 times theorem prover too weak. 1118 trivial. 0 not checked. [2019-09-07 21:20:26,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:20:26,501 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 21:20:26,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:26,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 1389 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:20:26,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:20:27,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1826 backedges. 722 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-07 21:20:27,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:20:27,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2019-09-07 21:20:27,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 21:20:27,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 21:20:27,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-07 21:20:27,307 INFO L87 Difference]: Start difference. First operand 9630 states and 10195 transitions. Second operand 8 states. [2019-09-07 21:20:31,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:20:31,165 INFO L93 Difference]: Finished difference Result 26019 states and 28593 transitions. [2019-09-07 21:20:31,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 21:20:31,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1029 [2019-09-07 21:20:31,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:20:31,243 INFO L225 Difference]: With dead ends: 26019 [2019-09-07 21:20:31,244 INFO L226 Difference]: Without dead ends: 16399 [2019-09-07 21:20:31,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1048 GetRequests, 1035 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 21:20:31,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16399 states. [2019-09-07 21:20:31,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16399 to 13764. [2019-09-07 21:20:31,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13764 states. [2019-09-07 21:20:31,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13764 states to 13764 states and 14571 transitions. [2019-09-07 21:20:31,563 INFO L78 Accepts]: Start accepts. Automaton has 13764 states and 14571 transitions. Word has length 1029 [2019-09-07 21:20:31,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:20:31,564 INFO L475 AbstractCegarLoop]: Abstraction has 13764 states and 14571 transitions. [2019-09-07 21:20:31,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 21:20:31,564 INFO L276 IsEmpty]: Start isEmpty. Operand 13764 states and 14571 transitions. [2019-09-07 21:20:31,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1280 [2019-09-07 21:20:31,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:20:31,603 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, 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, 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, 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, 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] [2019-09-07 21:20:31,603 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:20:31,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:20:31,604 INFO L82 PathProgramCache]: Analyzing trace with hash -244133563, now seen corresponding path program 1 times [2019-09-07 21:20:31,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:20:31,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:20:31,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:31,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:31,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2357 backedges. 772 proven. 273 refuted. 0 times theorem prover too weak. 1312 trivial. 0 not checked. [2019-09-07 21:20:36,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:20:36,616 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 21:20:36,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:36,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 1601 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 21:20:36,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:20:37,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:20:38,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2357 backedges. 1647 proven. 5 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2019-09-07 21:20:38,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:20:38,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2019-09-07 21:20:38,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 21:20:38,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 21:20:38,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-09-07 21:20:38,621 INFO L87 Difference]: Start difference. First operand 13764 states and 14571 transitions. Second operand 17 states. [2019-09-07 21:20:42,263 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-07 21:20:42,707 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-07 21:20:43,215 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-07 21:20:46,196 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-07 21:20:46,383 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-07 21:20:47,844 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-07 21:20:48,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:20:48,730 INFO L93 Difference]: Finished difference Result 27559 states and 29213 transitions. [2019-09-07 21:20:48,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 21:20:48,730 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1279 [2019-09-07 21:20:48,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:20:48,768 INFO L225 Difference]: With dead ends: 27559 [2019-09-07 21:20:48,768 INFO L226 Difference]: Without dead ends: 14477 [2019-09-07 21:20:48,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1350 GetRequests, 1299 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=550, Invalid=2102, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 21:20:48,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14477 states. [2019-09-07 21:20:48,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14477 to 14103. [2019-09-07 21:20:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14103 states. [2019-09-07 21:20:49,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14103 states to 14103 states and 14904 transitions. [2019-09-07 21:20:49,015 INFO L78 Accepts]: Start accepts. Automaton has 14103 states and 14904 transitions. Word has length 1279 [2019-09-07 21:20:49,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:20:49,017 INFO L475 AbstractCegarLoop]: Abstraction has 14103 states and 14904 transitions. [2019-09-07 21:20:49,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 21:20:49,017 INFO L276 IsEmpty]: Start isEmpty. Operand 14103 states and 14904 transitions. [2019-09-07 21:20:49,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1337 [2019-09-07 21:20:49,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:20:49,067 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:20:49,067 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:20:49,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:20:49,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1806238449, now seen corresponding path program 1 times [2019-09-07 21:20:49,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:20:49,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:20:49,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:49,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:49,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:20:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:51,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3637 backedges. 1131 proven. 12 refuted. 0 times theorem prover too weak. 2494 trivial. 0 not checked. [2019-09-07 21:20:51,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:20:51,269 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 21:20:51,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:20:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:20:51,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 1773 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 21:20:51,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:20:51,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:20:52,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3637 backedges. 1821 proven. 2 refuted. 0 times theorem prover too weak. 1814 trivial. 0 not checked. [2019-09-07 21:20:52,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:20:52,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-09-07 21:20:52,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 21:20:52,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 21:20:52,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-09-07 21:20:52,646 INFO L87 Difference]: Start difference. First operand 14103 states and 14904 transitions. Second operand 16 states. [2019-09-07 21:21:05,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:21:05,104 INFO L93 Difference]: Finished difference Result 30614 states and 32410 transitions. [2019-09-07 21:21:05,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-07 21:21:05,104 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1336 [2019-09-07 21:21:05,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:21:05,140 INFO L225 Difference]: With dead ends: 30614 [2019-09-07 21:21:05,140 INFO L226 Difference]: Without dead ends: 15453 [2019-09-07 21:21:05,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1418 GetRequests, 1366 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=447, Invalid=2309, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 21:21:05,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15453 states. [2019-09-07 21:21:05,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15453 to 14761. [2019-09-07 21:21:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14761 states. [2019-09-07 21:21:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14761 states to 14761 states and 15366 transitions. [2019-09-07 21:21:05,356 INFO L78 Accepts]: Start accepts. Automaton has 14761 states and 15366 transitions. Word has length 1336 [2019-09-07 21:21:05,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:21:05,357 INFO L475 AbstractCegarLoop]: Abstraction has 14761 states and 15366 transitions. [2019-09-07 21:21:05,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 21:21:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 14761 states and 15366 transitions. [2019-09-07 21:21:05,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1725 [2019-09-07 21:21:05,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:21:05,403 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:21:05,404 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:21:05,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:21:05,405 INFO L82 PathProgramCache]: Analyzing trace with hash 9875244, now seen corresponding path program 1 times [2019-09-07 21:21:05,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:21:05,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:21:05,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:21:05,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:21:05,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:21:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:21:11,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5500 backedges. 1017 proven. 597 refuted. 0 times theorem prover too weak. 3886 trivial. 0 not checked. [2019-09-07 21:21:11,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:21:11,772 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 21:21:11,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:21:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:21:12,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 2182 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 21:21:12,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:21:12,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:21:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5500 backedges. 3727 proven. 2 refuted. 0 times theorem prover too weak. 1771 trivial. 0 not checked. [2019-09-07 21:21:13,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:21:13,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-09-07 21:21:13,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 21:21:13,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 21:21:13,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-09-07 21:21:13,676 INFO L87 Difference]: Start difference. First operand 14761 states and 15366 transitions. Second operand 14 states. [2019-09-07 21:21:15,047 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-07 21:21:16,532 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-07 21:21:16,884 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-07 21:21:19,474 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-07 21:21:19,932 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-07 21:21:20,774 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-07 21:21:22,073 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-07 21:21:22,346 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-07 21:21:22,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:21:22,650 INFO L93 Difference]: Finished difference Result 29209 states and 30444 transitions. [2019-09-07 21:21:22,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 21:21:22,650 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1724 [2019-09-07 21:21:22,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:21:22,697 INFO L225 Difference]: With dead ends: 29209 [2019-09-07 21:21:22,698 INFO L226 Difference]: Without dead ends: 15469 [2019-09-07 21:21:22,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1805 GetRequests, 1753 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=538, Invalid=1912, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 21:21:22,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15469 states. [2019-09-07 21:21:22,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15469 to 14765. [2019-09-07 21:21:22,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14765 states. [2019-09-07 21:21:22,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14765 states to 14765 states and 15342 transitions. [2019-09-07 21:21:22,931 INFO L78 Accepts]: Start accepts. Automaton has 14765 states and 15342 transitions. Word has length 1724 [2019-09-07 21:21:22,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:21:22,932 INFO L475 AbstractCegarLoop]: Abstraction has 14765 states and 15342 transitions. [2019-09-07 21:21:22,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 21:21:22,932 INFO L276 IsEmpty]: Start isEmpty. Operand 14765 states and 15342 transitions. [2019-09-07 21:21:22,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1921 [2019-09-07 21:21:22,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:21:22,985 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 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, 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, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 21:21:22,985 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:21:22,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:21:22,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1574797423, now seen corresponding path program 1 times [2019-09-07 21:21:22,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:21:22,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:21:22,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:21:22,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:21:22,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:21:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:21:24,473 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2019-09-07 21:21:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6776 backedges. 2628 proven. 1443 refuted. 0 times theorem prover too weak. 2705 trivial. 0 not checked. [2019-09-07 21:21:29,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:21:29,012 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 21:21:29,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:21:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:21:29,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 2417 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:21:29,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:21:29,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:21:30,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6776 backedges. 3740 proven. 2 refuted. 0 times theorem prover too weak. 3034 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Stream closed [2019-09-07 21:21:30,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:21:30,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 5] total 22 [2019-09-07 21:21:30,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 21:21:30,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 21:21:30,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2019-09-07 21:21:30,941 INFO L87 Difference]: Start difference. First operand 14765 states and 15342 transitions. Second operand 22 states. [2019-09-07 21:21:37,785 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-07 21:21:53,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:21:53,906 INFO L93 Difference]: Finished difference Result 29964 states and 31233 transitions. [2019-09-07 21:21:53,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-07 21:21:53,908 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1920 [2019-09-07 21:21:53,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:21:53,940 INFO L225 Difference]: With dead ends: 29964 [2019-09-07 21:21:53,941 INFO L226 Difference]: Without dead ends: 14177 [2019-09-07 21:21:53,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2075 GetRequests, 1977 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1449, Invalid=8253, Unknown=0, NotChecked=0, Total=9702 [2019-09-07 21:21:53,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14177 states. [2019-09-07 21:21:54,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14177 to 13754. [2019-09-07 21:21:54,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13754 states. [2019-09-07 21:21:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13754 states to 13754 states and 14181 transitions. [2019-09-07 21:21:54,149 INFO L78 Accepts]: Start accepts. Automaton has 13754 states and 14181 transitions. Word has length 1920 [2019-09-07 21:21:54,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:21:54,150 INFO L475 AbstractCegarLoop]: Abstraction has 13754 states and 14181 transitions. [2019-09-07 21:21:54,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 21:21:54,151 INFO L276 IsEmpty]: Start isEmpty. Operand 13754 states and 14181 transitions. [2019-09-07 21:21:54,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1988 [2019-09-07 21:21:54,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:21:54,195 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:21:54,196 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:21:54,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:21:54,197 INFO L82 PathProgramCache]: Analyzing trace with hash 453355801, now seen corresponding path program 1 times [2019-09-07 21:21:54,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:21:54,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:21:54,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:21:54,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:21:54,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:21:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:22:00,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7803 backedges. 2261 proven. 1656 refuted. 0 times theorem prover too weak. 3886 trivial. 0 not checked. [2019-09-07 21:22:00,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:22:00,606 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 21:22:00,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:22:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:22:01,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 2521 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 21:22:01,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:22:01,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:22:02,767 INFO L134 CoverageAnalysis]: Checked inductivity of 7803 backedges. 5411 proven. 6 refuted. 0 times theorem prover too weak. 2386 trivial. 0 not checked. [2019-09-07 21:22:02,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:22:02,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 23 [2019-09-07 21:22:02,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 21:22:02,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 21:22:02,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2019-09-07 21:22:02,776 INFO L87 Difference]: Start difference. First operand 13754 states and 14181 transitions. Second operand 23 states. [2019-09-07 21:22:24,354 WARN L188 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 34 [2019-09-07 21:22:27,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:22:27,981 INFO L93 Difference]: Finished difference Result 25179 states and 26063 transitions. [2019-09-07 21:22:27,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-07 21:22:27,981 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1987 [2019-09-07 21:22:27,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:22:28,014 INFO L225 Difference]: With dead ends: 25179 [2019-09-07 21:22:28,015 INFO L226 Difference]: Without dead ends: 15190 [2019-09-07 21:22:28,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2135 GetRequests, 2039 SyntacticMatches, 4 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2671 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1356, Invalid=7386, Unknown=0, NotChecked=0, Total=8742 [2019-09-07 21:22:28,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15190 states. [2019-09-07 21:22:28,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15190 to 14454. [2019-09-07 21:22:28,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14454 states. [2019-09-07 21:22:28,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14454 states to 14454 states and 14923 transitions. [2019-09-07 21:22:28,214 INFO L78 Accepts]: Start accepts. Automaton has 14454 states and 14923 transitions. Word has length 1987 [2019-09-07 21:22:28,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:22:28,215 INFO L475 AbstractCegarLoop]: Abstraction has 14454 states and 14923 transitions. [2019-09-07 21:22:28,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 21:22:28,215 INFO L276 IsEmpty]: Start isEmpty. Operand 14454 states and 14923 transitions. [2019-09-07 21:22:28,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1994 [2019-09-07 21:22:28,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:22:28,263 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 21:22:28,263 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:22:28,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:22:28,264 INFO L82 PathProgramCache]: Analyzing trace with hash 311812437, now seen corresponding path program 1 times [2019-09-07 21:22:28,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:22:28,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:22:28,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:28,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:22:28,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:22:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 7508 backedges. 1383 proven. 3574 refuted. 0 times theorem prover too weak. 2551 trivial. 0 not checked. [2019-09-07 21:22:36,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:22:36,951 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 21:22:36,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:22:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:22:37,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 2527 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 21:22:37,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:22:37,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:37,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:22:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7508 backedges. 4472 proven. 2 refuted. 0 times theorem prover too weak. 3034 trivial. 0 not checked. [2019-09-07 21:22:39,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:22:39,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 5] total 24 [2019-09-07 21:22:39,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 21:22:39,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 21:22:39,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2019-09-07 21:22:39,040 INFO L87 Difference]: Start difference. First operand 14454 states and 14923 transitions. Second operand 24 states. [2019-09-07 21:23:00,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:23:00,332 INFO L93 Difference]: Finished difference Result 30625 states and 31770 transitions. [2019-09-07 21:23:00,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-07 21:23:00,333 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1993 [2019-09-07 21:23:00,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:23:00,365 INFO L225 Difference]: With dead ends: 30625 [2019-09-07 21:23:00,365 INFO L226 Difference]: Without dead ends: 17192 [2019-09-07 21:23:00,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2134 GetRequests, 2045 SyntacticMatches, 5 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2179 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1174, Invalid=6136, Unknown=0, NotChecked=0, Total=7310 [2019-09-07 21:23:00,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17192 states. [2019-09-07 21:23:00,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17192 to 15798. [2019-09-07 21:23:00,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15798 states. [2019-09-07 21:23:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15798 states to 15798 states and 16335 transitions. [2019-09-07 21:23:00,619 INFO L78 Accepts]: Start accepts. Automaton has 15798 states and 16335 transitions. Word has length 1993 [2019-09-07 21:23:00,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:23:00,620 INFO L475 AbstractCegarLoop]: Abstraction has 15798 states and 16335 transitions. [2019-09-07 21:23:00,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 21:23:00,620 INFO L276 IsEmpty]: Start isEmpty. Operand 15798 states and 16335 transitions. [2019-09-07 21:23:00,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2151 [2019-09-07 21:23:00,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:23:00,679 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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] [2019-09-07 21:23:00,679 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:23:00,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:23:00,680 INFO L82 PathProgramCache]: Analyzing trace with hash -23994177, now seen corresponding path program 1 times [2019-09-07 21:23:00,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:23:00,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:23:00,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:00,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:23:00,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:08,307 INFO L134 CoverageAnalysis]: Checked inductivity of 8856 backedges. 3164 proven. 1870 refuted. 0 times theorem prover too weak. 3822 trivial. 0 not checked. [2019-09-07 21:23:08,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:23:08,308 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) [2019-09-07 21:23:08,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:23:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:08,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 2724 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 21:23:08,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:23:08,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:09,695 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a18~0_915 Int)) (let ((.cse0 (mod v_~a18~0_915 299922))) (and (= 0 .cse0) (<= .cse0 (+ c_~a18~0 300079))))) (exists ((v_prenex_1 Int)) (let ((.cse1 (mod v_prenex_1 299922))) (and (<= .cse1 (+ c_~a18~0 600001)) (< v_prenex_1 0) (not (= 0 .cse1))))) (exists ((v_~a18~0_915 Int)) (and (<= 0 v_~a18~0_915) (<= (mod v_~a18~0_915 299922) (+ c_~a18~0 300079))))) is different from true [2019-09-07 21:23:10,498 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a18~0_915 Int)) (let ((.cse0 (mod v_~a18~0_915 299922))) (and (= 0 .cse0) (<= .cse0 (+ c_~a18~0 300079))))) (exists ((v_prenex_1 Int)) (let ((.cse1 (mod v_prenex_1 299922))) (and (<= .cse1 (+ c_~a18~0 600001)) (< v_prenex_1 0) (not (= 0 .cse1))))) (exists ((v_prenex_2 Int)) (and (<= (mod v_prenex_2 299922) (+ c_~a18~0 300079)) (<= 0 v_prenex_2)))) is different from true [2019-09-07 21:23:10,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:23:12,219 INFO L134 CoverageAnalysis]: Checked inductivity of 8856 backedges. 1352 proven. 10 refuted. 0 times theorem prover too weak. 7488 trivial. 6 not checked. [2019-09-07 21:23:12,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:23:12,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 7] total 24 [2019-09-07 21:23:12,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 21:23:12,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 21:23:12,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=393, Unknown=2, NotChecked=82, Total=552 [2019-09-07 21:23:12,227 INFO L87 Difference]: Start difference. First operand 15798 states and 16335 transitions. Second operand 24 states. [2019-09-07 21:23:38,153 WARN L188 SmtUtils]: Spent 4.68 s on a formula simplification. DAG size of input: 78 DAG size of output: 44 [2019-09-07 21:23:42,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:23:42,776 INFO L93 Difference]: Finished difference Result 31568 states and 32702 transitions. [2019-09-07 21:23:42,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-07 21:23:42,776 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 2150 [2019-09-07 21:23:42,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:23:42,814 INFO L225 Difference]: With dead ends: 31568 [2019-09-07 21:23:42,814 INFO L226 Difference]: Without dead ends: 19523 [2019-09-07 21:23:42,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2272 GetRequests, 2190 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1943 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=1180, Invalid=4830, Unknown=4, NotChecked=306, Total=6320 [2019-09-07 21:23:42,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19523 states. [2019-09-07 21:23:43,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19523 to 16811. [2019-09-07 21:23:43,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16811 states. [2019-09-07 21:23:43,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16811 states to 16811 states and 17402 transitions. [2019-09-07 21:23:43,073 INFO L78 Accepts]: Start accepts. Automaton has 16811 states and 17402 transitions. Word has length 2150 [2019-09-07 21:23:43,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:23:43,074 INFO L475 AbstractCegarLoop]: Abstraction has 16811 states and 17402 transitions. [2019-09-07 21:23:43,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 21:23:43,074 INFO L276 IsEmpty]: Start isEmpty. Operand 16811 states and 17402 transitions. [2019-09-07 21:23:43,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2272 [2019-09-07 21:23:43,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:23:43,134 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:23:43,134 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:23:43,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:23:43,135 INFO L82 PathProgramCache]: Analyzing trace with hash 692617203, now seen corresponding path program 1 times [2019-09-07 21:23:43,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:23:43,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:23:43,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:43,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:23:43,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:51,608 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 2139 proven. 1723 refuted. 0 times theorem prover too weak. 5303 trivial. 0 not checked. [2019-09-07 21:23:51,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:23:51,609 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 21:23:51,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:23:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:52,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 2822 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 21:23:52,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:23:52,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,559 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 29 [2019-09-07 21:23:52,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:23:52,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 21:23:52,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:52,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:23:56,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 2124 proven. 2 refuted. 0 times theorem prover too weak. 7039 trivial. 0 not checked. [2019-09-07 21:23:56,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:23:56,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2019-09-07 21:23:56,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 21:23:56,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 21:23:56,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-09-07 21:23:56,957 INFO L87 Difference]: Start difference. First operand 16811 states and 17402 transitions. Second operand 22 states. [2019-09-07 21:24:09,442 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-07 21:24:13,420 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 46 [2019-09-07 21:24:13,741 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2019-09-07 21:24:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:24:13,892 INFO L93 Difference]: Finished difference Result 29867 states and 30968 transitions. [2019-09-07 21:24:13,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-07 21:24:13,892 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 2271 [2019-09-07 21:24:13,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:24:13,911 INFO L225 Difference]: With dead ends: 29867 [2019-09-07 21:24:13,912 INFO L226 Difference]: Without dead ends: 16825 [2019-09-07 21:24:13,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2362 GetRequests, 2291 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=918, Invalid=4338, Unknown=0, NotChecked=0, Total=5256 [2019-09-07 21:24:13,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16825 states. [2019-09-07 21:24:14,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16825 to 16466. [2019-09-07 21:24:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16466 states. [2019-09-07 21:24:14,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16466 states to 16466 states and 17000 transitions. [2019-09-07 21:24:14,092 INFO L78 Accepts]: Start accepts. Automaton has 16466 states and 17000 transitions. Word has length 2271 [2019-09-07 21:24:14,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:24:14,094 INFO L475 AbstractCegarLoop]: Abstraction has 16466 states and 17000 transitions. [2019-09-07 21:24:14,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 21:24:14,094 INFO L276 IsEmpty]: Start isEmpty. Operand 16466 states and 17000 transitions. [2019-09-07 21:24:14,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2516 [2019-09-07 21:24:14,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:24:14,144 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 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 21:24:14,144 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:24:14,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:24:14,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1028022991, now seen corresponding path program 1 times [2019-09-07 21:24:14,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:24:14,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:24:14,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:24:14,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:24:14,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:24:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:24:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 11373 backedges. 884 proven. 281 refuted. 0 times theorem prover too weak. 10208 trivial. 0 not checked. [2019-09-07 21:24:18,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:24:18,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:24:18,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:24:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:24:19,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 3173 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 21:24:19,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:24:19,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:24:21,731 INFO L134 CoverageAnalysis]: Checked inductivity of 11373 backedges. 6338 proven. 2 refuted. 0 times theorem prover too weak. 5033 trivial. 0 not checked. [2019-09-07 21:24:21,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:24:21,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 21:24:21,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 21:24:21,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 21:24:21,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-07 21:24:21,741 INFO L87 Difference]: Start difference. First operand 16466 states and 17000 transitions. Second operand 10 states. [2019-09-07 21:24:25,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:24:25,655 INFO L93 Difference]: Finished difference Result 29185 states and 30174 transitions. [2019-09-07 21:24:25,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 21:24:25,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 2515 [2019-09-07 21:24:25,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:24:25,677 INFO L225 Difference]: With dead ends: 29185 [2019-09-07 21:24:25,677 INFO L226 Difference]: Without dead ends: 16488 [2019-09-07 21:24:25,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2554 GetRequests, 2527 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2019-09-07 21:24:25,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16488 states. [2019-09-07 21:24:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16488 to 16464. [2019-09-07 21:24:25,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16464 states. [2019-09-07 21:24:25,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16464 states to 16464 states and 16997 transitions. [2019-09-07 21:24:25,899 INFO L78 Accepts]: Start accepts. Automaton has 16464 states and 16997 transitions. Word has length 2515 [2019-09-07 21:24:25,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:24:25,900 INFO L475 AbstractCegarLoop]: Abstraction has 16464 states and 16997 transitions. [2019-09-07 21:24:25,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 21:24:25,900 INFO L276 IsEmpty]: Start isEmpty. Operand 16464 states and 16997 transitions. [2019-09-07 21:24:25,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2538 [2019-09-07 21:24:25,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:24:25,964 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:24:25,964 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:24:25,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:24:25,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1879004989, now seen corresponding path program 1 times [2019-09-07 21:24:25,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:24:25,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:24:25,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:24:25,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:24:25,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:24:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:24:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 11793 backedges. 2992 proven. 2703 refuted. 0 times theorem prover too weak. 6098 trivial. 0 not checked. [2019-09-07 21:24:35,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:24:35,165 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:24:35,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:24:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:24:35,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 3170 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:24:35,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:24:35,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:24:35,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:24:35,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:24:35,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:24:35,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:24:35,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:24:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 11793 backedges. 7859 proven. 10 refuted. 0 times theorem prover too weak. 3924 trivial. 0 not checked. [2019-09-07 21:24:38,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:24:38,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2019-09-07 21:24:38,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 21:24:38,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 21:24:38,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2019-09-07 21:24:38,685 INFO L87 Difference]: Start difference. First operand 16464 states and 16997 transitions. Second operand 21 states. [2019-09-07 21:24:49,843 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-07 21:24:50,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:24:50,954 INFO L93 Difference]: Finished difference Result 29865 states and 30863 transitions. [2019-09-07 21:24:50,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 21:24:50,955 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 2537 [2019-09-07 21:24:50,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:24:50,981 INFO L225 Difference]: With dead ends: 29865 [2019-09-07 21:24:50,981 INFO L226 Difference]: Without dead ends: 17170 [2019-09-07 21:24:50,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2636 GetRequests, 2569 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1251 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=813, Invalid=3743, Unknown=0, NotChecked=0, Total=4556 [2019-09-07 21:24:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17170 states. [2019-09-07 21:24:51,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17170 to 17142. [2019-09-07 21:24:51,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17142 states. [2019-09-07 21:24:51,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17142 states to 17142 states and 17677 transitions. [2019-09-07 21:24:51,176 INFO L78 Accepts]: Start accepts. Automaton has 17142 states and 17677 transitions. Word has length 2537 [2019-09-07 21:24:51,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:24:51,177 INFO L475 AbstractCegarLoop]: Abstraction has 17142 states and 17677 transitions. [2019-09-07 21:24:51,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 21:24:51,177 INFO L276 IsEmpty]: Start isEmpty. Operand 17142 states and 17677 transitions. [2019-09-07 21:24:51,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2647 [2019-09-07 21:24:51,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:24:51,229 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-09-07 21:24:51,229 INFO L418 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:24:51,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:24:51,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1736485432, now seen corresponding path program 1 times [2019-09-07 21:24:51,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:24:51,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:24:51,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:24:51,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:24:51,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:24:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:25:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 12182 backedges. 1995 proven. 6708 refuted. 0 times theorem prover too weak. 3479 trivial. 0 not checked. [2019-09-07 21:25:04,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:25:04,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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 21:25:04,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:25:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:25:05,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 3300 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:25:05,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:25:05,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:25:05,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:31:14,014 WARN L188 SmtUtils]: Spent 5.52 m on a formula simplification. DAG size of input: 324 DAG size of output: 63 [2019-09-07 21:31:16,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 21:31:19,358 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 39 [2019-09-07 21:31:19,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:31:22,131 INFO L134 CoverageAnalysis]: Checked inductivity of 12182 backedges. 7916 proven. 75 refuted. 0 times theorem prover too weak. 4191 trivial. 0 not checked. [2019-09-07 21:31:22,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:31:22,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 8] total 34 [2019-09-07 21:31:22,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 21:31:22,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 21:31:22,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=980, Unknown=17, NotChecked=0, Total=1122 [2019-09-07 21:31:22,141 INFO L87 Difference]: Start difference. First operand 17142 states and 17677 transitions. Second operand 34 states. [2019-09-07 21:31:32,633 WARN L188 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 150 DAG size of output: 20 [2019-09-07 21:31:34,733 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 26 [2019-09-07 21:31:35,237 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 24 [2019-09-07 21:31:57,697 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-07 21:32:10,150 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73