java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label17.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 19:27:04,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 19:27:04,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 19:27:04,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 19:27:04,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 19:27:04,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 19:27:04,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 19:27:04,539 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 19:27:04,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 19:27:04,541 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 19:27:04,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 19:27:04,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 19:27:04,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 19:27:04,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 19:27:04,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 19:27:04,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 19:27:04,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 19:27:04,548 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 19:27:04,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 19:27:04,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 19:27:04,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 19:27:04,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 19:27:04,557 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 19:27:04,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 19:27:04,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 19:27:04,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 19:27:04,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 19:27:04,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 19:27:04,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 19:27:04,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 19:27:04,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 19:27:04,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 19:27:04,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 19:27:04,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 19:27:04,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 19:27:04,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 19:27:04,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 19:27:04,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 19:27:04,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 19:27:04,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 19:27:04,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 19:27:04,571 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 19:27:04,587 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 19:27:04,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 19:27:04,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 19:27:04,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 19:27:04,589 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 19:27:04,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 19:27:04,589 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 19:27:04,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 19:27:04,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 19:27:04,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 19:27:04,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 19:27:04,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 19:27:04,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 19:27:04,590 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 19:27:04,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 19:27:04,591 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 19:27:04,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 19:27:04,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 19:27:04,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 19:27:04,592 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 19:27:04,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 19:27:04,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:27:04,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 19:27:04,593 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 19:27:04,593 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 19:27:04,593 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 19:27:04,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 19:27:04,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 19:27:04,594 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 19:27:04,621 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 19:27:04,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 19:27:04,638 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 19:27:04,641 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 19:27:04,641 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 19:27:04,642 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label17.c [2019-09-07 19:27:04,710 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53252f822/e90596c503e6474bb0df84de89e21d25/FLAG873cbecab [2019-09-07 19:27:05,489 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 19:27:05,492 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label17.c [2019-09-07 19:27:05,535 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53252f822/e90596c503e6474bb0df84de89e21d25/FLAG873cbecab [2019-09-07 19:27:05,581 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53252f822/e90596c503e6474bb0df84de89e21d25 [2019-09-07 19:27:05,592 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 19:27:05,594 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 19:27:05,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 19:27:05,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 19:27:05,603 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 19:27:05,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:27:05" (1/1) ... [2019-09-07 19:27:05,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aa53fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:27:05, skipping insertion in model container [2019-09-07 19:27:05,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:27:05" (1/1) ... [2019-09-07 19:27:05,615 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 19:27:05,797 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 19:27:07,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:27:07,297 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 19:27:07,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:27:07,996 INFO L192 MainTranslator]: Completed translation [2019-09-07 19:27:07,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:27:07 WrapperNode [2019-09-07 19:27:07,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 19:27:07,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 19:27:07,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 19:27:07,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 19:27:08,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:27:07" (1/1) ... [2019-09-07 19:27:08,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:27:07" (1/1) ... [2019-09-07 19:27:08,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:27:07" (1/1) ... [2019-09-07 19:27:08,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:27:07" (1/1) ... [2019-09-07 19:27:08,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:27:07" (1/1) ... [2019-09-07 19:27:08,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:27:07" (1/1) ... [2019-09-07 19:27:08,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:27:07" (1/1) ... [2019-09-07 19:27:08,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 19:27:08,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 19:27:08,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 19:27:08,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 19:27:08,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:27:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:27:08,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 19:27:08,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 19:27:08,396 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 19:27:08,396 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 19:27:08,396 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 19:27:08,396 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 19:27:08,397 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 19:27:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 19:27:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 19:27:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 19:27:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 19:27:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 19:27:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 19:27:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 19:27:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 19:27:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 19:27:08,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 19:27:15,057 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 19:27:15,060 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 19:27:15,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:27:15 BoogieIcfgContainer [2019-09-07 19:27:15,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 19:27:15,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 19:27:15,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 19:27:15,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 19:27:15,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:27:05" (1/3) ... [2019-09-07 19:27:15,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6524a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:27:15, skipping insertion in model container [2019-09-07 19:27:15,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:27:07" (2/3) ... [2019-09-07 19:27:15,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6524a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:27:15, skipping insertion in model container [2019-09-07 19:27:15,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:27:15" (3/3) ... [2019-09-07 19:27:15,074 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem13_label17.c [2019-09-07 19:27:15,087 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 19:27:15,096 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 19:27:15,113 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 19:27:15,166 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 19:27:15,167 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 19:27:15,167 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 19:27:15,167 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 19:27:15,168 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 19:27:15,168 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 19:27:15,168 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 19:27:15,168 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 19:27:15,168 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 19:27:15,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states. [2019-09-07 19:27:15,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 19:27:15,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:27:15,223 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:27:15,225 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:27:15,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:27:15,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1992287976, now seen corresponding path program 1 times [2019-09-07 19:27:15,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:27:15,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:27:15,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:15,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:27:15,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:27:15,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:27:15,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:27:15,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:27:15,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:27:15,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:27:15,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:27:15,545 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand 3 states. [2019-09-07 19:27:21,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:27:21,506 INFO L93 Difference]: Finished difference Result 3084 states and 5696 transitions. [2019-09-07 19:27:21,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:27:21,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-07 19:27:21,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:27:21,545 INFO L225 Difference]: With dead ends: 3084 [2019-09-07 19:27:21,545 INFO L226 Difference]: Without dead ends: 1903 [2019-09-07 19:27:21,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:27:21,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2019-09-07 19:27:21,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1897. [2019-09-07 19:27:21,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1897 states. [2019-09-07 19:27:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 3341 transitions. [2019-09-07 19:27:21,709 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 3341 transitions. Word has length 39 [2019-09-07 19:27:21,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:27:21,709 INFO L475 AbstractCegarLoop]: Abstraction has 1897 states and 3341 transitions. [2019-09-07 19:27:21,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:27:21,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 3341 transitions. [2019-09-07 19:27:21,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-07 19:27:21,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:27:21,715 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:27:21,716 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:27:21,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:27:21,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1709804397, now seen corresponding path program 1 times [2019-09-07 19:27:21,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:27:21,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:27:21,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:21,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:27:21,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:27:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:27:21,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:27:21,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:27:21,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:27:21,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:27:21,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:27:21,975 INFO L87 Difference]: Start difference. First operand 1897 states and 3341 transitions. Second operand 6 states. [2019-09-07 19:27:30,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:27:30,213 INFO L93 Difference]: Finished difference Result 5506 states and 9832 transitions. [2019-09-07 19:27:30,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:27:30,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-09-07 19:27:30,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:27:30,236 INFO L225 Difference]: With dead ends: 5506 [2019-09-07 19:27:30,236 INFO L226 Difference]: Without dead ends: 3615 [2019-09-07 19:27:30,243 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 19:27:30,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2019-09-07 19:27:30,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 3586. [2019-09-07 19:27:30,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3586 states. [2019-09-07 19:27:30,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3586 states and 5675 transitions. [2019-09-07 19:27:30,361 INFO L78 Accepts]: Start accepts. Automaton has 3586 states and 5675 transitions. Word has length 115 [2019-09-07 19:27:30,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:27:30,362 INFO L475 AbstractCegarLoop]: Abstraction has 3586 states and 5675 transitions. [2019-09-07 19:27:30,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:27:30,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3586 states and 5675 transitions. [2019-09-07 19:27:30,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-07 19:27:30,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:27:30,366 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:27:30,366 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:27:30,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:27:30,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1473268219, now seen corresponding path program 1 times [2019-09-07 19:27:30,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:27:30,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:27:30,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:30,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:27:30,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:27:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:27:30,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:27:30,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:27:30,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:27:30,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:27:30,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:27:30,639 INFO L87 Difference]: Start difference. First operand 3586 states and 5675 transitions. Second operand 6 states. [2019-09-07 19:27:37,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:27:37,442 INFO L93 Difference]: Finished difference Result 10675 states and 17456 transitions. [2019-09-07 19:27:37,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:27:37,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-09-07 19:27:37,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:27:37,485 INFO L225 Difference]: With dead ends: 10675 [2019-09-07 19:27:37,485 INFO L226 Difference]: Without dead ends: 7095 [2019-09-07 19:27:37,498 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 19:27:37,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7095 states. [2019-09-07 19:27:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7095 to 7042. [2019-09-07 19:27:37,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7042 states. [2019-09-07 19:27:37,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7042 states to 7042 states and 10528 transitions. [2019-09-07 19:27:37,690 INFO L78 Accepts]: Start accepts. Automaton has 7042 states and 10528 transitions. Word has length 134 [2019-09-07 19:27:37,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:27:37,691 INFO L475 AbstractCegarLoop]: Abstraction has 7042 states and 10528 transitions. [2019-09-07 19:27:37,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:27:37,691 INFO L276 IsEmpty]: Start isEmpty. Operand 7042 states and 10528 transitions. [2019-09-07 19:27:37,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-07 19:27:37,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:27:37,697 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:27:37,697 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:27:37,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:27:37,697 INFO L82 PathProgramCache]: Analyzing trace with hash 421047581, now seen corresponding path program 1 times [2019-09-07 19:27:37,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:27:37,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:27:37,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:37,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:27:37,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:27:37,896 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:27:37,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:27:37,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:27:37,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:27:37,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:27:37,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:27:37,899 INFO L87 Difference]: Start difference. First operand 7042 states and 10528 transitions. Second operand 6 states. [2019-09-07 19:27:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:27:45,763 INFO L93 Difference]: Finished difference Result 17986 states and 27928 transitions. [2019-09-07 19:27:45,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:27:45,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2019-09-07 19:27:45,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:27:45,824 INFO L225 Difference]: With dead ends: 17986 [2019-09-07 19:27:45,824 INFO L226 Difference]: Without dead ends: 10950 [2019-09-07 19:27:45,846 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 19:27:45,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10950 states. [2019-09-07 19:27:46,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10950 to 10780. [2019-09-07 19:27:46,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10780 states. [2019-09-07 19:27:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10780 states to 10780 states and 15825 transitions. [2019-09-07 19:27:46,111 INFO L78 Accepts]: Start accepts. Automaton has 10780 states and 15825 transitions. Word has length 146 [2019-09-07 19:27:46,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:27:46,112 INFO L475 AbstractCegarLoop]: Abstraction has 10780 states and 15825 transitions. [2019-09-07 19:27:46,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:27:46,112 INFO L276 IsEmpty]: Start isEmpty. Operand 10780 states and 15825 transitions. [2019-09-07 19:27:46,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-07 19:27:46,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:27:46,117 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:27:46,117 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:27:46,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:27:46,118 INFO L82 PathProgramCache]: Analyzing trace with hash -132984160, now seen corresponding path program 1 times [2019-09-07 19:27:46,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:27:46,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:27:46,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:46,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:27:46,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:27:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 64 proven. 71 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 19:27:46,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:27:46,287 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:27:46,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:27:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:27:46,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 19:27:46,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:27:46,624 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 19:27:46,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:27:46,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2019-09-07 19:27:46,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:27:46,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:27:46,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:27:46,638 INFO L87 Difference]: Start difference. First operand 10780 states and 15825 transitions. Second operand 6 states. [2019-09-07 19:27:58,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:27:58,058 INFO L93 Difference]: Finished difference Result 32499 states and 53209 transitions. [2019-09-07 19:27:58,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 19:27:58,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 209 [2019-09-07 19:27:58,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:27:58,215 INFO L225 Difference]: With dead ends: 32499 [2019-09-07 19:27:58,215 INFO L226 Difference]: Without dead ends: 21725 [2019-09-07 19:27:58,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:27:58,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21725 states. [2019-09-07 19:27:59,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21725 to 21298. [2019-09-07 19:27:59,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21298 states. [2019-09-07 19:27:59,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21298 states to 21298 states and 30929 transitions. [2019-09-07 19:27:59,093 INFO L78 Accepts]: Start accepts. Automaton has 21298 states and 30929 transitions. Word has length 209 [2019-09-07 19:27:59,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:27:59,094 INFO L475 AbstractCegarLoop]: Abstraction has 21298 states and 30929 transitions. [2019-09-07 19:27:59,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:27:59,094 INFO L276 IsEmpty]: Start isEmpty. Operand 21298 states and 30929 transitions. [2019-09-07 19:27:59,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-07 19:27:59,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:27:59,100 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:27:59,101 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:27:59,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:27:59,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1345390356, now seen corresponding path program 1 times [2019-09-07 19:27:59,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:27:59,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:27:59,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:59,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:27:59,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:27:59,314 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-07 19:27:59,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:27:59,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:27:59,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:27:59,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:27:59,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:27:59,316 INFO L87 Difference]: Start difference. First operand 21298 states and 30929 transitions. Second operand 4 states. [2019-09-07 19:28:08,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:28:08,041 INFO L93 Difference]: Finished difference Result 71184 states and 111350 transitions. [2019-09-07 19:28:08,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:28:08,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-09-07 19:28:08,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:28:08,262 INFO L225 Difference]: With dead ends: 71184 [2019-09-07 19:28:08,262 INFO L226 Difference]: Without dead ends: 49892 [2019-09-07 19:28:09,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:28:09,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49892 states. [2019-09-07 19:28:10,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49892 to 49089. [2019-09-07 19:28:10,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49089 states. [2019-09-07 19:28:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49089 states to 49089 states and 72388 transitions. [2019-09-07 19:28:10,469 INFO L78 Accepts]: Start accepts. Automaton has 49089 states and 72388 transitions. Word has length 239 [2019-09-07 19:28:10,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:28:10,470 INFO L475 AbstractCegarLoop]: Abstraction has 49089 states and 72388 transitions. [2019-09-07 19:28:10,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:28:10,474 INFO L276 IsEmpty]: Start isEmpty. Operand 49089 states and 72388 transitions. [2019-09-07 19:28:10,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-07 19:28:10,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:28:10,480 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:28:10,480 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:28:10,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:28:10,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1329033116, now seen corresponding path program 1 times [2019-09-07 19:28:10,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:28:10,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:28:10,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:28:10,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:28:10,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:28:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:28:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 64 proven. 91 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 19:28:10,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:28:10,664 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:28:10,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:28:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:28:10,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 19:28:10,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:28:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-07 19:28:10,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:28:10,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-07 19:28:10,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 19:28:10,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 19:28:10,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:28:10,864 INFO L87 Difference]: Start difference. First operand 49089 states and 72388 transitions. Second operand 8 states. [2019-09-07 19:28:32,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:28:32,369 INFO L93 Difference]: Finished difference Result 158598 states and 249645 transitions. [2019-09-07 19:28:32,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 19:28:32,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 239 [2019-09-07 19:28:32,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:28:32,854 INFO L225 Difference]: With dead ends: 158598 [2019-09-07 19:28:32,855 INFO L226 Difference]: Without dead ends: 109515 [2019-09-07 19:28:33,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=329, Invalid=1393, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 19:28:33,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109515 states. [2019-09-07 19:28:38,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109515 to 106848. [2019-09-07 19:28:38,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106848 states. [2019-09-07 19:28:38,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106848 states to 106848 states and 158173 transitions. [2019-09-07 19:28:38,680 INFO L78 Accepts]: Start accepts. Automaton has 106848 states and 158173 transitions. Word has length 239 [2019-09-07 19:28:38,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:28:38,681 INFO L475 AbstractCegarLoop]: Abstraction has 106848 states and 158173 transitions. [2019-09-07 19:28:38,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 19:28:38,681 INFO L276 IsEmpty]: Start isEmpty. Operand 106848 states and 158173 transitions. [2019-09-07 19:28:38,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-07 19:28:38,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:28:38,693 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:28:38,694 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:28:38,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:28:38,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1549440089, now seen corresponding path program 1 times [2019-09-07 19:28:38,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:28:38,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:28:38,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:28:38,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:28:38,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:28:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:28:38,998 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 249 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 19:28:38,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:28:38,999 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) [2019-09-07 19:28:39,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:28:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:28:39,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:28:39,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:28:39,260 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 249 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 19:28:39,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:28:39,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:28:39,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:28:39,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:28:39,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:28:39,275 INFO L87 Difference]: Start difference. First operand 106848 states and 158173 transitions. Second operand 9 states. [2019-09-07 19:28:59,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:28:59,460 INFO L93 Difference]: Finished difference Result 252670 states and 418039 transitions. [2019-09-07 19:28:59,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 19:28:59,461 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 324 [2019-09-07 19:28:59,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:29:00,098 INFO L225 Difference]: With dead ends: 252670 [2019-09-07 19:29:00,098 INFO L226 Difference]: Without dead ends: 146631 [2019-09-07 19:29:00,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 19:29:00,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146631 states. [2019-09-07 19:29:03,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146631 to 146228. [2019-09-07 19:29:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146228 states. [2019-09-07 19:29:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146228 states to 146228 states and 220978 transitions. [2019-09-07 19:29:04,301 INFO L78 Accepts]: Start accepts. Automaton has 146228 states and 220978 transitions. Word has length 324 [2019-09-07 19:29:04,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:29:04,301 INFO L475 AbstractCegarLoop]: Abstraction has 146228 states and 220978 transitions. [2019-09-07 19:29:04,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:29:04,302 INFO L276 IsEmpty]: Start isEmpty. Operand 146228 states and 220978 transitions. [2019-09-07 19:29:04,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-09-07 19:29:04,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:29:04,323 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:29:04,323 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:29:04,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:29:04,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1724341017, now seen corresponding path program 1 times [2019-09-07 19:29:04,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:29:04,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:29:04,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:29:04,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:29:04,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:29:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:29:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 155 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 19:29:04,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:29:04,645 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:29:04,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:29:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:29:04,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:29:04,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:29:04,853 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-09-07 19:29:04,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:29:04,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-07 19:29:04,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:29:04,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:29:04,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:29:04,859 INFO L87 Difference]: Start difference. First operand 146228 states and 220978 transitions. Second operand 6 states. [2019-09-07 19:29:19,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:29:19,035 INFO L93 Difference]: Finished difference Result 303454 states and 470241 transitions. [2019-09-07 19:29:19,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:29:19,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 359 [2019-09-07 19:29:19,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:29:19,788 INFO L225 Difference]: With dead ends: 303454 [2019-09-07 19:29:19,789 INFO L226 Difference]: Without dead ends: 158035 [2019-09-07 19:29:20,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:29:20,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158035 states. [2019-09-07 19:29:22,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158035 to 155944. [2019-09-07 19:29:22,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155944 states. [2019-09-07 19:29:23,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155944 states to 155944 states and 209680 transitions. [2019-09-07 19:29:23,210 INFO L78 Accepts]: Start accepts. Automaton has 155944 states and 209680 transitions. Word has length 359 [2019-09-07 19:29:23,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:29:23,210 INFO L475 AbstractCegarLoop]: Abstraction has 155944 states and 209680 transitions. [2019-09-07 19:29:23,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:29:23,211 INFO L276 IsEmpty]: Start isEmpty. Operand 155944 states and 209680 transitions. [2019-09-07 19:29:23,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2019-09-07 19:29:23,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:29:23,373 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:29:23,373 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:29:23,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:29:23,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1793554742, now seen corresponding path program 1 times [2019-09-07 19:29:23,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:29:23,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:29:23,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:29:23,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:29:23,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:29:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:29:24,163 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 101 proven. 355 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-07 19:29:24,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:29:24,163 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 19:29:24,178 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 19:29:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:29:24,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:29:24,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:29:27,297 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 530 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-07 19:29:27,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:29:27,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:29:27,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:29:27,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:29:27,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:29:27,303 INFO L87 Difference]: Start difference. First operand 155944 states and 209680 transitions. Second operand 9 states. [2019-09-07 19:29:38,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:29:38,729 INFO L93 Difference]: Finished difference Result 309641 states and 424411 transitions. [2019-09-07 19:29:38,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 19:29:38,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 632 [2019-09-07 19:29:38,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:29:39,185 INFO L225 Difference]: With dead ends: 309641 [2019-09-07 19:29:39,186 INFO L226 Difference]: Without dead ends: 154506 [2019-09-07 19:29:39,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 637 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-09-07 19:29:39,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154506 states. [2019-09-07 19:29:41,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154506 to 145188. [2019-09-07 19:29:41,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145188 states. [2019-09-07 19:29:42,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145188 states to 145188 states and 192448 transitions. [2019-09-07 19:29:42,399 INFO L78 Accepts]: Start accepts. Automaton has 145188 states and 192448 transitions. Word has length 632 [2019-09-07 19:29:42,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:29:42,400 INFO L475 AbstractCegarLoop]: Abstraction has 145188 states and 192448 transitions. [2019-09-07 19:29:42,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:29:42,400 INFO L276 IsEmpty]: Start isEmpty. Operand 145188 states and 192448 transitions. [2019-09-07 19:29:42,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 877 [2019-09-07 19:29:42,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:29:42,593 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:29:42,594 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:29:42,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:29:42,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1628785628, now seen corresponding path program 1 times [2019-09-07 19:29:42,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:29:42,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:29:42,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:29:42,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:29:42,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:29:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:29:43,545 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 143 proven. 212 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-07 19:29:43,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:29:43,546 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:29:43,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:29:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:29:43,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 19:29:43,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:29:47,214 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 272 proven. 2 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-07 19:29:47,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:29:47,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-09-07 19:29:47,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 19:29:47,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 19:29:47,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-07 19:29:47,225 INFO L87 Difference]: Start difference. First operand 145188 states and 192448 transitions. Second operand 12 states. [2019-09-07 19:30:29,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:30:29,884 INFO L93 Difference]: Finished difference Result 371779 states and 520042 transitions. [2019-09-07 19:30:29,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 19:30:29,884 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 876 [2019-09-07 19:30:29,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:30:30,945 INFO L225 Difference]: With dead ends: 371779 [2019-09-07 19:30:30,945 INFO L226 Difference]: Without dead ends: 227400 [2019-09-07 19:30:31,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 927 GetRequests, 893 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=326, Invalid=934, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 19:30:31,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227400 states. [2019-09-07 19:30:35,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227400 to 224648. [2019-09-07 19:30:35,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224648 states. [2019-09-07 19:30:36,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224648 states to 224648 states and 298587 transitions. [2019-09-07 19:30:36,006 INFO L78 Accepts]: Start accepts. Automaton has 224648 states and 298587 transitions. Word has length 876 [2019-09-07 19:30:36,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:30:36,006 INFO L475 AbstractCegarLoop]: Abstraction has 224648 states and 298587 transitions. [2019-09-07 19:30:36,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 19:30:36,006 INFO L276 IsEmpty]: Start isEmpty. Operand 224648 states and 298587 transitions. [2019-09-07 19:30:36,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1006 [2019-09-07 19:30:36,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:30:36,234 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:30:36,234 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:30:36,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:30:36,235 INFO L82 PathProgramCache]: Analyzing trace with hash -246322009, now seen corresponding path program 1 times [2019-09-07 19:30:36,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:30:36,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:30:36,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:30:36,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:30:36,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:30:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:30:38,460 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 234 proven. 498 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-09-07 19:30:38,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:30:38,460 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:30:38,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:30:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:30:38,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 1372 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 19:30:38,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:30:43,217 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 544 proven. 2 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2019-09-07 19:30:43,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:30:43,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-09-07 19:30:43,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 19:30:43,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 19:30:43,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-07 19:30:43,224 INFO L87 Difference]: Start difference. First operand 224648 states and 298587 transitions. Second operand 13 states. [2019-09-07 19:31:13,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:31:13,040 INFO L93 Difference]: Finished difference Result 501017 states and 637729 transitions. [2019-09-07 19:31:13,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-07 19:31:13,041 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1005 [2019-09-07 19:31:13,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:31:13,637 INFO L225 Difference]: With dead ends: 501017 [2019-09-07 19:31:13,637 INFO L226 Difference]: Without dead ends: 277178 [2019-09-07 19:31:13,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1158 GetRequests, 1070 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2948 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1226, Invalid=6784, Unknown=0, NotChecked=0, Total=8010 [2019-09-07 19:31:14,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277178 states. [2019-09-07 19:31:22,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277178 to 251224. [2019-09-07 19:31:22,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251224 states. [2019-09-07 19:31:22,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251224 states to 251224 states and 296329 transitions. [2019-09-07 19:31:22,441 INFO L78 Accepts]: Start accepts. Automaton has 251224 states and 296329 transitions. Word has length 1005 [2019-09-07 19:31:22,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:31:22,442 INFO L475 AbstractCegarLoop]: Abstraction has 251224 states and 296329 transitions. [2019-09-07 19:31:22,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 19:31:22,442 INFO L276 IsEmpty]: Start isEmpty. Operand 251224 states and 296329 transitions. [2019-09-07 19:31:22,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 922 [2019-09-07 19:31:22,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:31:22,537 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:31:22,538 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:31:22,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:31:22,538 INFO L82 PathProgramCache]: Analyzing trace with hash -656423320, now seen corresponding path program 1 times [2019-09-07 19:31:22,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:31:22,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:31:22,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:31:22,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:31:22,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:31:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:31:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 330 proven. 133 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-09-07 19:31:23,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:31:23,745 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:31:23,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:31:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:31:23,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:31:24,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:31:24,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:31:24,784 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 539 proven. 2 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-09-07 19:31:24,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:31:24,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 19:31:24,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 19:31:24,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 19:31:24,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-07 19:31:24,797 INFO L87 Difference]: Start difference. First operand 251224 states and 296329 transitions. Second operand 13 states. [2019-09-07 19:32:39,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:32:39,792 INFO L93 Difference]: Finished difference Result 779031 states and 985176 transitions. [2019-09-07 19:32:39,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-07 19:32:39,792 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 921 [2019-09-07 19:32:39,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:32:41,269 INFO L225 Difference]: With dead ends: 779031 [2019-09-07 19:32:41,269 INFO L226 Difference]: Without dead ends: 528616 [2019-09-07 19:32:41,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1084 GetRequests, 992 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3184 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1196, Invalid=7546, Unknown=0, NotChecked=0, Total=8742 [2019-09-07 19:32:41,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528616 states. [2019-09-07 19:32:55,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528616 to 512031. [2019-09-07 19:32:55,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512031 states. [2019-09-07 19:32:56,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512031 states to 512031 states and 608285 transitions. [2019-09-07 19:32:56,251 INFO L78 Accepts]: Start accepts. Automaton has 512031 states and 608285 transitions. Word has length 921 [2019-09-07 19:32:56,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:32:56,251 INFO L475 AbstractCegarLoop]: Abstraction has 512031 states and 608285 transitions. [2019-09-07 19:32:56,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 19:32:56,252 INFO L276 IsEmpty]: Start isEmpty. Operand 512031 states and 608285 transitions. [2019-09-07 19:32:56,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 982 [2019-09-07 19:32:56,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:32:56,418 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:32:56,418 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:32:56,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:32:56,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1370799426, now seen corresponding path program 1 times [2019-09-07 19:32:56,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:32:56,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:32:56,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:32:56,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:32:56,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:32:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:33:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 252 proven. 234 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-09-07 19:33:03,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:33:03,032 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:33:03,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:33:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:33:03,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 1346 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 19:33:03,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:33:03,652 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 555 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-07 19:33:03,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:33:03,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-09-07 19:33:03,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 19:33:03,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 19:33:03,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:33:03,661 INFO L87 Difference]: Start difference. First operand 512031 states and 608285 transitions. Second operand 8 states. [2019-09-07 19:33:28,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:33:28,974 INFO L93 Difference]: Finished difference Result 1205762 states and 1432020 transitions. [2019-09-07 19:33:28,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 19:33:28,974 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 981 [2019-09-07 19:33:28,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:33:31,766 INFO L225 Difference]: With dead ends: 1205762 [2019-09-07 19:33:31,766 INFO L226 Difference]: Without dead ends: 646133 [2019-09-07 19:33:32,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1010 GetRequests, 992 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2019-09-07 19:33:32,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646133 states. [2019-09-07 19:33:50,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646133 to 587314. [2019-09-07 19:33:50,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587314 states. [2019-09-07 19:33:50,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587314 states to 587314 states and 661463 transitions. [2019-09-07 19:33:50,821 INFO L78 Accepts]: Start accepts. Automaton has 587314 states and 661463 transitions. Word has length 981 [2019-09-07 19:33:50,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:33:50,821 INFO L475 AbstractCegarLoop]: Abstraction has 587314 states and 661463 transitions. [2019-09-07 19:33:50,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 19:33:50,821 INFO L276 IsEmpty]: Start isEmpty. Operand 587314 states and 661463 transitions. [2019-09-07 19:33:50,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1046 [2019-09-07 19:33:50,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:33:50,955 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:33:50,955 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:33:50,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:33:50,956 INFO L82 PathProgramCache]: Analyzing trace with hash 545237182, now seen corresponding path program 1 times [2019-09-07 19:33:50,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:33:50,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:33:50,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:33:50,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:33:50,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:33:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:33:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 991 backedges. 203 proven. 627 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-09-07 19:33:59,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:33:59,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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:33:59,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:33:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:33:59,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 1416 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:33:59,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:33:59,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:34:00,298 INFO L134 CoverageAnalysis]: Checked inductivity of 991 backedges. 770 proven. 2 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-09-07 19:34:00,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:34:00,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-09-07 19:34:00,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 19:34:00,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 19:34:00,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-09-07 19:34:00,304 INFO L87 Difference]: Start difference. First operand 587314 states and 661463 transitions. Second operand 16 states. [2019-09-07 19:34:41,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:34:41,164 INFO L93 Difference]: Finished difference Result 1088109 states and 1225440 transitions. [2019-09-07 19:34:41,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-07 19:34:41,164 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1045 [2019-09-07 19:34:41,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:34:43,622 INFO L225 Difference]: With dead ends: 1088109 [2019-09-07 19:34:43,622 INFO L226 Difference]: Without dead ends: 630981 [2019-09-07 19:34:43,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1232 GetRequests, 1123 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4618 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1717, Invalid=10273, Unknown=0, NotChecked=0, Total=11990 [2019-09-07 19:34:44,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630981 states. [2019-09-07 19:35:04,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630981 to 620880. [2019-09-07 19:35:04,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620880 states. [2019-09-07 19:35:06,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620880 states to 620880 states and 694360 transitions. [2019-09-07 19:35:06,177 INFO L78 Accepts]: Start accepts. Automaton has 620880 states and 694360 transitions. Word has length 1045 [2019-09-07 19:35:06,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:35:06,177 INFO L475 AbstractCegarLoop]: Abstraction has 620880 states and 694360 transitions. [2019-09-07 19:35:06,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 19:35:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 620880 states and 694360 transitions. [2019-09-07 19:35:06,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1185 [2019-09-07 19:35:06,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:35:06,320 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:35:06,321 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:35:06,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:35:06,321 INFO L82 PathProgramCache]: Analyzing trace with hash 619401026, now seen corresponding path program 1 times [2019-09-07 19:35:06,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:35:06,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:35:06,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:35:06,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:35:06,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:35:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:35:14,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 220 proven. 173 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2019-09-07 19:35:14,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:35:14,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:35:14,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:35:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:35:15,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:35:15,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:35:15,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 897 proven. 2 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2019-09-07 19:35:15,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:35:15,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:35:15,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:35:15,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:35:15,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:35:15,815 INFO L87 Difference]: Start difference. First operand 620880 states and 694360 transitions. Second operand 9 states. [2019-09-07 19:35:35,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:35:35,691 INFO L93 Difference]: Finished difference Result 1268013 states and 1456734 transitions. [2019-09-07 19:35:35,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 19:35:35,692 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1184 [2019-09-07 19:35:35,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:35:38,068 INFO L225 Difference]: With dead ends: 1268013 [2019-09-07 19:35:38,068 INFO L226 Difference]: Without dead ends: 655990 [2019-09-07 19:35:38,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1219 GetRequests, 1197 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2019-09-07 19:35:38,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655990 states. [2019-09-07 19:35:56,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655990 to 653963. [2019-09-07 19:35:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653963 states. [2019-09-07 19:35:58,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653963 states to 653963 states and 750554 transitions. [2019-09-07 19:35:58,999 INFO L78 Accepts]: Start accepts. Automaton has 653963 states and 750554 transitions. Word has length 1184 [2019-09-07 19:35:59,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:35:59,000 INFO L475 AbstractCegarLoop]: Abstraction has 653963 states and 750554 transitions. [2019-09-07 19:35:59,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:35:59,000 INFO L276 IsEmpty]: Start isEmpty. Operand 653963 states and 750554 transitions. [2019-09-07 19:35:59,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1312 [2019-09-07 19:35:59,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:35:59,310 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:35:59,310 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:35:59,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:35:59,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1926882001, now seen corresponding path program 1 times [2019-09-07 19:35:59,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:35:59,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:35:59,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:35:59,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:35:59,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:35:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:36:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 848 proven. 2 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2019-09-07 19:36:08,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:36:08,624 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:36:08,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:36:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:36:08,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 1709 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 19:36:08,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:36:08,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:08,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:08,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:08,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:08,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:08,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:08,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:08,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:08,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:08,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:08,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:08,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:08,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:08,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:08,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:08,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:08,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:09,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:09,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:09,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:09,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:09,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:09,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:09,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:09,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:09,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:09,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 848 proven. 2 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2019-09-07 19:36:09,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:36:09,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-09-07 19:36:09,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 19:36:09,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 19:36:09,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:36:09,958 INFO L87 Difference]: Start difference. First operand 653963 states and 750554 transitions. Second operand 8 states. [2019-09-07 19:36:46,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:36:46,000 INFO L93 Difference]: Finished difference Result 1464053 states and 1812258 transitions. [2019-09-07 19:36:46,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 19:36:46,001 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1311 [2019-09-07 19:36:46,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:36:49,667 INFO L225 Difference]: With dead ends: 1464053 [2019-09-07 19:36:49,667 INFO L226 Difference]: Without dead ends: 818125 [2019-09-07 19:36:50,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1339 GetRequests, 1323 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-07 19:36:51,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818125 states. [2019-09-07 19:37:07,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818125 to 790285. [2019-09-07 19:37:07,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790285 states. [2019-09-07 19:37:26,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790285 states to 790285 states and 909823 transitions. [2019-09-07 19:37:26,274 INFO L78 Accepts]: Start accepts. Automaton has 790285 states and 909823 transitions. Word has length 1311 [2019-09-07 19:37:26,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:37:26,275 INFO L475 AbstractCegarLoop]: Abstraction has 790285 states and 909823 transitions. [2019-09-07 19:37:26,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 19:37:26,275 INFO L276 IsEmpty]: Start isEmpty. Operand 790285 states and 909823 transitions. [2019-09-07 19:37:26,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1317 [2019-09-07 19:37:26,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:37:26,508 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:37:26,509 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:37:26,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:37:26,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1481459391, now seen corresponding path program 1 times [2019-09-07 19:37:26,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:37:26,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:37:26,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:26,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:37:26,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:39,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1465 backedges. 890 proven. 2 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2019-09-07 19:37:39,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:37:39,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:37:39,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:37:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:40,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 1754 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 19:37:40,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:37:40,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:37:40,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:37:40,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:37:40,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:37:41,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:37:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1465 backedges. 1045 proven. 2 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2019-09-07 19:37:42,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:37:42,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2019-09-07 19:37:42,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 19:37:42,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 19:37:42,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=87, Unknown=1, NotChecked=0, Total=110 [2019-09-07 19:37:42,896 INFO L87 Difference]: Start difference. First operand 790285 states and 909823 transitions. Second operand 11 states. [2019-09-07 19:37:46,894 WARN L188 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 45 DAG size of output: 31