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/Problem15_label59.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:53:30,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:53:30,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:53:30,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:53:30,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:53:30,419 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:53:30,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:53:30,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:53:30,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:53:30,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:53:30,426 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:53:30,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:53:30,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:53:30,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:53:30,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:53:30,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:53:30,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:53:30,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:53:30,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:53:30,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:53:30,438 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:53:30,440 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:53:30,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:53:30,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:53:30,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:53:30,444 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:53:30,444 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:53:30,445 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:53:30,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:53:30,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:53:30,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:53:30,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:53:30,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:53:30,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:53:30,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:53:30,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:53:30,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:53:30,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:53:30,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:53:30,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:53:30,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:53:30,455 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 20:53:30,469 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:53:30,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:53:30,471 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:53:30,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:53:30,471 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:53:30,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:53:30,472 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:53:30,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:53:30,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:53:30,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:53:30,472 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:53:30,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:53:30,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:53:30,473 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:53:30,473 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:53:30,473 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:53:30,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:53:30,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:53:30,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:53:30,474 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:53:30,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:53:30,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:53:30,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:53:30,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:53:30,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:53:30,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:53:30,476 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:53:30,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:53:30,476 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:53:30,505 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:53:30,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:53:30,521 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:53:30,522 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:53:30,523 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:53:30,524 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label59.c [2019-09-07 20:53:30,604 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a9049fb2/0d87589175d747489129aa7d9eb03e34/FLAG5c8e45a74 [2019-09-07 20:53:31,241 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:53:31,242 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label59.c [2019-09-07 20:53:31,266 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a9049fb2/0d87589175d747489129aa7d9eb03e34/FLAG5c8e45a74 [2019-09-07 20:53:31,407 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a9049fb2/0d87589175d747489129aa7d9eb03e34 [2019-09-07 20:53:31,420 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:53:31,421 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:53:31,425 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:53:31,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:53:31,430 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:53:31,431 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:53:31" (1/1) ... [2019-09-07 20:53:31,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ae8722e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:53:31, skipping insertion in model container [2019-09-07 20:53:31,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:53:31" (1/1) ... [2019-09-07 20:53:31,442 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:53:31,530 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:53:32,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:53:32,424 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:53:32,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:53:32,768 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:53:32,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:53:32 WrapperNode [2019-09-07 20:53:32,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:53:32,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:53:32,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:53:32,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:53:32,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:53:32" (1/1) ... [2019-09-07 20:53:32,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:53:32" (1/1) ... [2019-09-07 20:53:32,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:53:32" (1/1) ... [2019-09-07 20:53:32,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:53:32" (1/1) ... [2019-09-07 20:53:32,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:53:32" (1/1) ... [2019-09-07 20:53:32,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:53:32" (1/1) ... [2019-09-07 20:53:32,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:53:32" (1/1) ... [2019-09-07 20:53:33,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:53:33,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:53:33,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:53:33,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:53:33,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:53:32" (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 20:53:33,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:53:33,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:53:33,104 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:53:33,104 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 20:53:33,104 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:53:33,105 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:53:33,105 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 20:53:33,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:53:33,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:53:33,106 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:53:33,107 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:53:33,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:53:33,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:53:36,329 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:53:36,329 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:53:36,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:53:36 BoogieIcfgContainer [2019-09-07 20:53:36,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:53:36,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:53:36,332 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:53:36,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:53:36,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:53:31" (1/3) ... [2019-09-07 20:53:36,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60529bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:53:36, skipping insertion in model container [2019-09-07 20:53:36,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:53:32" (2/3) ... [2019-09-07 20:53:36,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60529bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:53:36, skipping insertion in model container [2019-09-07 20:53:36,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:53:36" (3/3) ... [2019-09-07 20:53:36,340 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label59.c [2019-09-07 20:53:36,352 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:53:36,362 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:53:36,380 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:53:36,417 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:53:36,418 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:53:36,418 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:53:36,418 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:53:36,419 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:53:36,419 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:53:36,419 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:53:36,419 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:53:36,419 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:53:36,449 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states. [2019-09-07 20:53:36,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 20:53:36,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:53:36,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:53:36,462 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:53:36,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:53:36,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1109513128, now seen corresponding path program 1 times [2019-09-07 20:53:36,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:53:36,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:53:36,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:53:36,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:53:36,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:53:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:53:36,842 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 20:53:36,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:53:36,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:53:36,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:53:36,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:53:36,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:53:36,869 INFO L87 Difference]: Start difference. First operand 437 states. Second operand 4 states. [2019-09-07 20:53:42,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:53:42,612 INFO L93 Difference]: Finished difference Result 1554 states and 2845 transitions. [2019-09-07 20:53:42,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:53:42,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-09-07 20:53:42,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:53:42,641 INFO L225 Difference]: With dead ends: 1554 [2019-09-07 20:53:42,641 INFO L226 Difference]: Without dead ends: 1036 [2019-09-07 20:53:42,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:53:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-09-07 20:53:42,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 697. [2019-09-07 20:53:42,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-07 20:53:42,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1188 transitions. [2019-09-07 20:53:42,779 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1188 transitions. Word has length 60 [2019-09-07 20:53:42,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:53:42,781 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 1188 transitions. [2019-09-07 20:53:42,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:53:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1188 transitions. [2019-09-07 20:53:42,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-07 20:53:42,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:53:42,793 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:53:42,793 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:53:42,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:53:42,794 INFO L82 PathProgramCache]: Analyzing trace with hash -933858500, now seen corresponding path program 1 times [2019-09-07 20:53:42,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:53:42,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:53:42,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:53:42,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:53:42,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:53:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:53:43,037 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:53:43,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:53:43,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:53:43,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:53:43,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:53:43,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:53:43,043 INFO L87 Difference]: Start difference. First operand 697 states and 1188 transitions. Second operand 4 states. [2019-09-07 20:53:46,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:53:46,664 INFO L93 Difference]: Finished difference Result 2633 states and 4598 transitions. [2019-09-07 20:53:46,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:53:46,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-07 20:53:46,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:53:46,678 INFO L225 Difference]: With dead ends: 2633 [2019-09-07 20:53:46,679 INFO L226 Difference]: Without dead ends: 1942 [2019-09-07 20:53:46,682 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 20:53:46,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2019-09-07 20:53:46,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1942. [2019-09-07 20:53:46,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-09-07 20:53:46,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 3051 transitions. [2019-09-07 20:53:46,766 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 3051 transitions. Word has length 129 [2019-09-07 20:53:46,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:53:46,770 INFO L475 AbstractCegarLoop]: Abstraction has 1942 states and 3051 transitions. [2019-09-07 20:53:46,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:53:46,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 3051 transitions. [2019-09-07 20:53:46,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-07 20:53:46,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:53:46,784 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, 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] [2019-09-07 20:53:46,784 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:53:46,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:53:46,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1262729336, now seen corresponding path program 1 times [2019-09-07 20:53:46,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:53:46,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:53:46,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:53:46,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:53:46,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:53:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:53:47,002 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:53:47,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:53:47,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 20:53:47,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 20:53:47,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 20:53:47,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 20:53:47,007 INFO L87 Difference]: Start difference. First operand 1942 states and 3051 transitions. Second operand 5 states. [2019-09-07 20:53:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:53:51,860 INFO L93 Difference]: Finished difference Result 5818 states and 9313 transitions. [2019-09-07 20:53:51,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:53:51,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-07 20:53:51,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:53:51,889 INFO L225 Difference]: With dead ends: 5818 [2019-09-07 20:53:51,890 INFO L226 Difference]: Without dead ends: 3882 [2019-09-07 20:53:51,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:53:51,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3882 states. [2019-09-07 20:53:52,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3882 to 3857. [2019-09-07 20:53:52,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3857 states. [2019-09-07 20:53:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3857 states to 3857 states and 5736 transitions. [2019-09-07 20:53:52,031 INFO L78 Accepts]: Start accepts. Automaton has 3857 states and 5736 transitions. Word has length 150 [2019-09-07 20:53:52,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:53:52,041 INFO L475 AbstractCegarLoop]: Abstraction has 3857 states and 5736 transitions. [2019-09-07 20:53:52,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 20:53:52,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3857 states and 5736 transitions. [2019-09-07 20:53:52,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-07 20:53:52,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:53:52,045 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, 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] [2019-09-07 20:53:52,046 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:53:52,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:53:52,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1278749795, now seen corresponding path program 1 times [2019-09-07 20:53:52,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:53:52,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:53:52,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:53:52,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:53:52,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:53:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:53:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:53:52,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:53:52,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 20:53:52,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:53:52,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:53:52,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:53:52,299 INFO L87 Difference]: Start difference. First operand 3857 states and 5736 transitions. Second operand 6 states. [2019-09-07 20:53:55,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:53:55,679 INFO L93 Difference]: Finished difference Result 9980 states and 15663 transitions. [2019-09-07 20:53:55,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 20:53:55,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-09-07 20:53:55,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:53:55,721 INFO L225 Difference]: With dead ends: 9980 [2019-09-07 20:53:55,721 INFO L226 Difference]: Without dead ends: 6436 [2019-09-07 20:53:55,734 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 20:53:55,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6436 states. [2019-09-07 20:53:55,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6436 to 6386. [2019-09-07 20:53:55,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6386 states. [2019-09-07 20:53:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6386 states to 6386 states and 9588 transitions. [2019-09-07 20:53:55,928 INFO L78 Accepts]: Start accepts. Automaton has 6386 states and 9588 transitions. Word has length 163 [2019-09-07 20:53:55,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:53:55,928 INFO L475 AbstractCegarLoop]: Abstraction has 6386 states and 9588 transitions. [2019-09-07 20:53:55,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:53:55,929 INFO L276 IsEmpty]: Start isEmpty. Operand 6386 states and 9588 transitions. [2019-09-07 20:53:55,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-07 20:53:55,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:53:55,933 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, 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 20:53:55,934 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:53:55,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:53:55,934 INFO L82 PathProgramCache]: Analyzing trace with hash -457386156, now seen corresponding path program 1 times [2019-09-07 20:53:55,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:53:55,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:53:55,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:53:55,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:53:55,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:53:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:53:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:53:56,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:53:56,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 20:53:56,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 20:53:56,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 20:53:56,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 20:53:56,077 INFO L87 Difference]: Start difference. First operand 6386 states and 9588 transitions. Second operand 5 states. [2019-09-07 20:53:59,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:53:59,589 INFO L93 Difference]: Finished difference Result 17267 states and 26656 transitions. [2019-09-07 20:53:59,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:53:59,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-07 20:53:59,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:53:59,701 INFO L225 Difference]: With dead ends: 17267 [2019-09-07 20:53:59,701 INFO L226 Difference]: Without dead ends: 7078 [2019-09-07 20:53:59,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:53:59,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7078 states. [2019-09-07 20:53:59,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7078 to 7041. [2019-09-07 20:53:59,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7041 states. [2019-09-07 20:53:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7041 states to 7041 states and 8725 transitions. [2019-09-07 20:53:59,906 INFO L78 Accepts]: Start accepts. Automaton has 7041 states and 8725 transitions. Word has length 176 [2019-09-07 20:53:59,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:53:59,906 INFO L475 AbstractCegarLoop]: Abstraction has 7041 states and 8725 transitions. [2019-09-07 20:53:59,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 20:53:59,907 INFO L276 IsEmpty]: Start isEmpty. Operand 7041 states and 8725 transitions. [2019-09-07 20:53:59,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-07 20:53:59,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:53:59,911 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, 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] [2019-09-07 20:53:59,911 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:53:59,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:53:59,912 INFO L82 PathProgramCache]: Analyzing trace with hash -636504067, now seen corresponding path program 1 times [2019-09-07 20:53:59,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:53:59,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:53:59,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:53:59,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:53:59,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:53:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:54:00,236 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:54:00,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:54:00,237 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) [2019-09-07 20:54:00,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:54:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:54:00,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 20:54:00,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:54:00,482 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 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 20:54:00,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:54:00,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-09-07 20:54:00,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 20:54:00,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 20:54:00,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-07 20:54:00,491 INFO L87 Difference]: Start difference. First operand 7041 states and 8725 transitions. Second operand 10 states. [2019-09-07 20:54:07,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:54:07,207 INFO L93 Difference]: Finished difference Result 17319 states and 21651 transitions. [2019-09-07 20:54:07,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 20:54:07,207 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 207 [2019-09-07 20:54:07,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:54:07,248 INFO L225 Difference]: With dead ends: 17319 [2019-09-07 20:54:07,248 INFO L226 Difference]: Without dead ends: 10276 [2019-09-07 20:54:07,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=251, Invalid=939, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 20:54:07,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10276 states. [2019-09-07 20:54:07,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10276 to 9893. [2019-09-07 20:54:07,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9893 states. [2019-09-07 20:54:07,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9893 states to 9893 states and 11910 transitions. [2019-09-07 20:54:07,531 INFO L78 Accepts]: Start accepts. Automaton has 9893 states and 11910 transitions. Word has length 207 [2019-09-07 20:54:07,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:54:07,531 INFO L475 AbstractCegarLoop]: Abstraction has 9893 states and 11910 transitions. [2019-09-07 20:54:07,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 20:54:07,532 INFO L276 IsEmpty]: Start isEmpty. Operand 9893 states and 11910 transitions. [2019-09-07 20:54:07,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-07 20:54:07,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:54:07,544 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:54:07,545 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:54:07,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:54:07,545 INFO L82 PathProgramCache]: Analyzing trace with hash -773985051, now seen corresponding path program 1 times [2019-09-07 20:54:07,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:54:07,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:54:07,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:54:07,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:54:07,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:54:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:54:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-07 20:54:07,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:54:07,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:54:07,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:54:07,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:54:07,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:54:07,777 INFO L87 Difference]: Start difference. First operand 9893 states and 11910 transitions. Second operand 4 states. [2019-09-07 20:54:10,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:54:10,408 INFO L93 Difference]: Finished difference Result 22880 states and 27858 transitions. [2019-09-07 20:54:10,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:54:10,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 296 [2019-09-07 20:54:10,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:54:10,449 INFO L225 Difference]: With dead ends: 22880 [2019-09-07 20:54:10,449 INFO L226 Difference]: Without dead ends: 13300 [2019-09-07 20:54:10,476 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 20:54:10,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13300 states. [2019-09-07 20:54:10,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13300 to 12362. [2019-09-07 20:54:10,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12362 states. [2019-09-07 20:54:10,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12362 states to 12362 states and 14317 transitions. [2019-09-07 20:54:10,737 INFO L78 Accepts]: Start accepts. Automaton has 12362 states and 14317 transitions. Word has length 296 [2019-09-07 20:54:10,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:54:10,738 INFO L475 AbstractCegarLoop]: Abstraction has 12362 states and 14317 transitions. [2019-09-07 20:54:10,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:54:10,738 INFO L276 IsEmpty]: Start isEmpty. Operand 12362 states and 14317 transitions. [2019-09-07 20:54:10,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-09-07 20:54:10,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:54:10,758 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, 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, 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] [2019-09-07 20:54:10,758 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:54:10,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:54:10,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1476526282, now seen corresponding path program 1 times [2019-09-07 20:54:10,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:54:10,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:54:10,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:54:10,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:54:10,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:54:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:54:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 343 proven. 2 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-07 20:54:11,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:54:11,682 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 20:54:11,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:54:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:54:11,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 20:54:11,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:54:12,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:54:12,366 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-09-07 20:54:12,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:54:12,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2019-09-07 20:54:12,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 20:54:12,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 20:54:12,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:54:12,372 INFO L87 Difference]: Start difference. First operand 12362 states and 14317 transitions. Second operand 11 states. [2019-09-07 20:54:17,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:54:17,839 INFO L93 Difference]: Finished difference Result 25091 states and 29167 transitions. [2019-09-07 20:54:17,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 20:54:17,841 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 399 [2019-09-07 20:54:17,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:54:17,886 INFO L225 Difference]: With dead ends: 25091 [2019-09-07 20:54:17,887 INFO L226 Difference]: Without dead ends: 13046 [2019-09-07 20:54:17,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2019-09-07 20:54:17,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13046 states. [2019-09-07 20:54:18,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13046 to 13014. [2019-09-07 20:54:18,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13014 states. [2019-09-07 20:54:18,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13014 states to 13014 states and 15066 transitions. [2019-09-07 20:54:18,180 INFO L78 Accepts]: Start accepts. Automaton has 13014 states and 15066 transitions. Word has length 399 [2019-09-07 20:54:18,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:54:18,181 INFO L475 AbstractCegarLoop]: Abstraction has 13014 states and 15066 transitions. [2019-09-07 20:54:18,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 20:54:18,182 INFO L276 IsEmpty]: Start isEmpty. Operand 13014 states and 15066 transitions. [2019-09-07 20:54:18,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2019-09-07 20:54:18,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:54:18,227 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:54:18,227 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:54:18,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:54:18,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1642920228, now seen corresponding path program 1 times [2019-09-07 20:54:18,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:54:18,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:54:18,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:54:18,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:54:18,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:54:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:54:19,017 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 303 proven. 156 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2019-09-07 20:54:19,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:54:19,017 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 20:54:19,039 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 20:54:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:54:19,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:54:19,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:54:19,647 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 527 proven. 2 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-09-07 20:54:19,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:54:19,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:54:19,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:54:19,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:54:19,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:54:19,665 INFO L87 Difference]: Start difference. First operand 13014 states and 15066 transitions. Second operand 9 states. [2019-09-07 20:54:24,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:54:24,882 INFO L93 Difference]: Finished difference Result 31062 states and 38468 transitions. [2019-09-07 20:54:24,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 20:54:24,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 613 [2019-09-07 20:54:24,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:54:24,961 INFO L225 Difference]: With dead ends: 31062 [2019-09-07 20:54:24,962 INFO L226 Difference]: Without dead ends: 18365 [2019-09-07 20:54:24,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 620 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 20:54:25,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18365 states. [2019-09-07 20:54:25,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18365 to 18295. [2019-09-07 20:54:25,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18295 states. [2019-09-07 20:54:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18295 states to 18295 states and 21715 transitions. [2019-09-07 20:54:25,416 INFO L78 Accepts]: Start accepts. Automaton has 18295 states and 21715 transitions. Word has length 613 [2019-09-07 20:54:25,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:54:25,417 INFO L475 AbstractCegarLoop]: Abstraction has 18295 states and 21715 transitions. [2019-09-07 20:54:25,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:54:25,418 INFO L276 IsEmpty]: Start isEmpty. Operand 18295 states and 21715 transitions. [2019-09-07 20:54:25,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2019-09-07 20:54:25,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:54:25,451 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, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:54:25,451 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:54:25,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:54:25,451 INFO L82 PathProgramCache]: Analyzing trace with hash -653833719, now seen corresponding path program 1 times [2019-09-07 20:54:25,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:54:25,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:54:25,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:54:25,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:54:25,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:54:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:54:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 543 proven. 2 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2019-09-07 20:54:26,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:54:26,397 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) [2019-09-07 20:54:26,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:54:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:54:26,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:54:26,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:54:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 543 proven. 2 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2019-09-07 20:54:26,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:54:26,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:54:26,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:54:26,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:54:26,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:54:26,979 INFO L87 Difference]: Start difference. First operand 18295 states and 21715 transitions. Second operand 9 states. [2019-09-07 20:54:30,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:54:30,906 INFO L93 Difference]: Finished difference Result 35471 states and 41618 transitions. [2019-09-07 20:54:30,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 20:54:30,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 708 [2019-09-07 20:54:30,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:54:30,949 INFO L225 Difference]: With dead ends: 35471 [2019-09-07 20:54:30,949 INFO L226 Difference]: Without dead ends: 17800 [2019-09-07 20:54:30,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 713 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 20:54:30,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17800 states. [2019-09-07 20:54:31,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17800 to 17710. [2019-09-07 20:54:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17710 states. [2019-09-07 20:54:31,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17710 states to 17710 states and 19471 transitions. [2019-09-07 20:54:31,227 INFO L78 Accepts]: Start accepts. Automaton has 17710 states and 19471 transitions. Word has length 708 [2019-09-07 20:54:31,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:54:31,229 INFO L475 AbstractCegarLoop]: Abstraction has 17710 states and 19471 transitions. [2019-09-07 20:54:31,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:54:31,229 INFO L276 IsEmpty]: Start isEmpty. Operand 17710 states and 19471 transitions. [2019-09-07 20:54:31,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2019-09-07 20:54:31,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:54:31,278 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, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:54:31,278 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:54:31,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:54:31,279 INFO L82 PathProgramCache]: Analyzing trace with hash 386186436, now seen corresponding path program 1 times [2019-09-07 20:54:31,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:54:31,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:54:31,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:54:31,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:54:31,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:54:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:54:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 560 proven. 52 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2019-09-07 20:54:32,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:54:32,228 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:54:32,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:54:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:54:32,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 20:54:32,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:54:32,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:54:32,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:54:32,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:54:33,839 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 556 proven. 56 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2019-09-07 20:54:33,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:54:33,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2019-09-07 20:54:33,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 20:54:33,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 20:54:33,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-07 20:54:33,846 INFO L87 Difference]: Start difference. First operand 17710 states and 19471 transitions. Second operand 10 states. [2019-09-07 20:54:39,135 WARN L188 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-09-07 20:55:16,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:55:16,934 INFO L93 Difference]: Finished difference Result 37953 states and 41869 transitions. [2019-09-07 20:55:16,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 20:55:16,934 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 728 [2019-09-07 20:55:16,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:55:16,982 INFO L225 Difference]: With dead ends: 37953 [2019-09-07 20:55:16,982 INFO L226 Difference]: Without dead ends: 21808 [2019-09-07 20:55:17,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 732 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-09-07 20:55:17,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21808 states. [2019-09-07 20:55:17,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21808 to 21447. [2019-09-07 20:55:17,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21447 states. [2019-09-07 20:55:17,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21447 states to 21447 states and 23341 transitions. [2019-09-07 20:55:17,352 INFO L78 Accepts]: Start accepts. Automaton has 21447 states and 23341 transitions. Word has length 728 [2019-09-07 20:55:17,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:55:17,353 INFO L475 AbstractCegarLoop]: Abstraction has 21447 states and 23341 transitions. [2019-09-07 20:55:17,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 20:55:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand 21447 states and 23341 transitions. [2019-09-07 20:55:17,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 749 [2019-09-07 20:55:17,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:55:17,379 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:55:17,379 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:55:17,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:55:17,380 INFO L82 PathProgramCache]: Analyzing trace with hash 260887123, now seen corresponding path program 1 times [2019-09-07 20:55:17,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:55:17,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:55:17,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:55:17,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:55:17,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:55:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:55:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 995 backedges. 488 proven. 147 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-09-07 20:55:18,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:55:18,399 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 20:55:18,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:55:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:55:18,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:55:18,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:55:18,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:55:18,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:57:23,260 WARN L188 SmtUtils]: Spent 2.05 m on a formula simplification. DAG size of input: 591 DAG size of output: 109 [2019-09-07 20:57:25,715 INFO L134 CoverageAnalysis]: Checked inductivity of 995 backedges. 831 proven. 2 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-09-07 20:57:25,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:57:25,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-09-07 20:57:25,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 20:57:25,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 20:57:25,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:57:25,722 INFO L87 Difference]: Start difference. First operand 21447 states and 23341 transitions. Second operand 8 states. [2019-09-07 20:58:15,742 WARN L188 SmtUtils]: Spent 49.95 s on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2019-09-07 20:58:47,107 WARN L188 SmtUtils]: Spent 26.53 s on a formula simplification that was a NOOP. DAG size: 112 [2019-09-07 20:59:41,480 WARN L188 SmtUtils]: Spent 46.42 s on a formula simplification. DAG size of input: 115 DAG size of output: 110 [2019-09-07 21:00:30,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:00:30,088 INFO L93 Difference]: Finished difference Result 48424 states and 53556 transitions. [2019-09-07 21:00:30,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 21:00:30,088 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 748 [2019-09-07 21:00:30,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:00:30,148 INFO L225 Difference]: With dead ends: 48424 [2019-09-07 21:00:30,149 INFO L226 Difference]: Without dead ends: 28857 [2019-09-07 21:00:30,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 769 GetRequests, 750 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 249.3s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 21:00:30,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28857 states. [2019-09-07 21:00:30,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28857 to 27618. [2019-09-07 21:00:30,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27618 states. [2019-09-07 21:00:30,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27618 states to 27618 states and 30395 transitions. [2019-09-07 21:00:30,875 INFO L78 Accepts]: Start accepts. Automaton has 27618 states and 30395 transitions. Word has length 748 [2019-09-07 21:00:30,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:00:30,875 INFO L475 AbstractCegarLoop]: Abstraction has 27618 states and 30395 transitions. [2019-09-07 21:00:30,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 21:00:30,876 INFO L276 IsEmpty]: Start isEmpty. Operand 27618 states and 30395 transitions. [2019-09-07 21:00:30,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2019-09-07 21:00:30,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:00:30,909 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:00:30,909 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:00:30,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:00:30,910 INFO L82 PathProgramCache]: Analyzing trace with hash 2057153128, now seen corresponding path program 1 times [2019-09-07 21:00:30,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:00:30,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:00:30,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:00:30,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:00:30,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:00:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:00:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 287 proven. 4 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2019-09-07 21:00:31,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:00:31,456 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:00:31,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:00:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:00:31,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 1140 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 21:00:31,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:00:32,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 882 proven. 0 refuted. 0 times theorem prover too weak. 563 trivial. 0 not checked. [2019-09-07 21:00:32,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:00:32,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-07 21:00:32,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 21:00:32,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 21:00:32,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:00:32,365 INFO L87 Difference]: Start difference. First operand 27618 states and 30395 transitions. Second operand 3 states. [2019-09-07 21:00:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:00:33,507 INFO L93 Difference]: Finished difference Result 53037 states and 58525 transitions. [2019-09-07 21:00:33,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 21:00:33,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 841 [2019-09-07 21:00:33,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:00:33,563 INFO L225 Difference]: With dead ends: 53037 [2019-09-07 21:00:33,563 INFO L226 Difference]: Without dead ends: 27299 [2019-09-07 21:00:33,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 843 GetRequests, 842 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:00:33,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27299 states. [2019-09-07 21:00:34,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27299 to 27295. [2019-09-07 21:00:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27295 states. [2019-09-07 21:00:34,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27295 states to 27295 states and 30021 transitions. [2019-09-07 21:00:34,261 INFO L78 Accepts]: Start accepts. Automaton has 27295 states and 30021 transitions. Word has length 841 [2019-09-07 21:00:34,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:00:34,262 INFO L475 AbstractCegarLoop]: Abstraction has 27295 states and 30021 transitions. [2019-09-07 21:00:34,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 21:00:34,262 INFO L276 IsEmpty]: Start isEmpty. Operand 27295 states and 30021 transitions. [2019-09-07 21:00:34,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2019-09-07 21:00:34,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:00:34,293 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:00:34,294 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:00:34,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:00:34,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1176786216, now seen corresponding path program 1 times [2019-09-07 21:00:34,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:00:34,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:00:34,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:00:34,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:00:34,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:00:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:00:35,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 287 proven. 4 refuted. 0 times theorem prover too weak. 1101 trivial. 0 not checked. [2019-09-07 21:00:35,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:00:35,995 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:00:36,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:00:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:00:36,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 21:00:36,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:00:36,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 783 proven. 0 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2019-09-07 21:00:36,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:00:36,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-07 21:00:36,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 21:00:36,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 21:00:36,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:00:36,754 INFO L87 Difference]: Start difference. First operand 27295 states and 30021 transitions. Second operand 3 states. [2019-09-07 21:00:38,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:00:38,573 INFO L93 Difference]: Finished difference Result 53596 states and 59142 transitions. [2019-09-07 21:00:38,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 21:00:38,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 875 [2019-09-07 21:00:38,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:00:38,631 INFO L225 Difference]: With dead ends: 53596 [2019-09-07 21:00:38,632 INFO L226 Difference]: Without dead ends: 28181 [2019-09-07 21:00:38,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 877 GetRequests, 876 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:00:38,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28181 states. [2019-09-07 21:00:39,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28181 to 26944. [2019-09-07 21:00:39,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26944 states. [2019-09-07 21:00:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26944 states to 26944 states and 29347 transitions. [2019-09-07 21:00:39,134 INFO L78 Accepts]: Start accepts. Automaton has 26944 states and 29347 transitions. Word has length 875 [2019-09-07 21:00:39,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:00:39,134 INFO L475 AbstractCegarLoop]: Abstraction has 26944 states and 29347 transitions. [2019-09-07 21:00:39,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 21:00:39,135 INFO L276 IsEmpty]: Start isEmpty. Operand 26944 states and 29347 transitions. [2019-09-07 21:00:39,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 911 [2019-09-07 21:00:39,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:00:39,156 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:00:39,157 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:00:39,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:00:39,157 INFO L82 PathProgramCache]: Analyzing trace with hash -316515928, now seen corresponding path program 1 times [2019-09-07 21:00:39,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:00:39,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:00:39,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:00:39,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:00:39,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:00:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:00:40,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1531 backedges. 280 proven. 932 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-09-07 21:00:40,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:00:40,637 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:00:40,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:00:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:00:40,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 1201 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 21:00:40,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:00:40,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:00:40,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:00:40,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:00:40,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:00:40,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:00:41,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:00:41,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 21:00:41,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:00:41,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 21:00:42,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1531 backedges. 1281 proven. 6 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2019-09-07 21:00:42,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:00:42,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-09-07 21:00:42,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 21:00:42,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 21:00:42,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-09-07 21:00:42,028 INFO L87 Difference]: Start difference. First operand 26944 states and 29347 transitions. Second operand 18 states. [2019-09-07 21:00:51,008 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-07 21:00:56,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:00:56,577 INFO L93 Difference]: Finished difference Result 60773 states and 66299 transitions. [2019-09-07 21:00:56,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-07 21:00:56,577 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 910 [2019-09-07 21:00:56,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:00:56,632 INFO L225 Difference]: With dead ends: 60773 [2019-09-07 21:00:56,633 INFO L226 Difference]: Without dead ends: 34453 [2019-09-07 21:00:56,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1061 GetRequests, 966 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3331 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1554, Invalid=7758, Unknown=0, NotChecked=0, Total=9312 [2019-09-07 21:00:56,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34453 states. [2019-09-07 21:00:57,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34453 to 32554. [2019-09-07 21:00:57,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32554 states. [2019-09-07 21:00:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32554 states to 32554 states and 35448 transitions. [2019-09-07 21:00:57,204 INFO L78 Accepts]: Start accepts. Automaton has 32554 states and 35448 transitions. Word has length 910 [2019-09-07 21:00:57,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:00:57,205 INFO L475 AbstractCegarLoop]: Abstraction has 32554 states and 35448 transitions. [2019-09-07 21:00:57,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 21:00:57,205 INFO L276 IsEmpty]: Start isEmpty. Operand 32554 states and 35448 transitions. [2019-09-07 21:00:57,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 929 [2019-09-07 21:00:57,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:00:57,222 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:00:57,222 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:00:57,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:00:57,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1967024518, now seen corresponding path program 1 times [2019-09-07 21:00:57,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:00:57,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:00:57,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:00:57,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:00:57,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:00:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:00:57,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1547 backedges. 747 proven. 52 refuted. 0 times theorem prover too weak. 748 trivial. 0 not checked. [2019-09-07 21:00:57,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:00:57,959 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:00:57,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:00:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:00:58,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 1220 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 21:00:58,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:00:58,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:00:58,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:00:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1547 backedges. 1136 proven. 2 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2019-09-07 21:00:58,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:00:58,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 21:00:58,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 21:00:58,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 21:00:58,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-07 21:00:58,899 INFO L87 Difference]: Start difference. First operand 32554 states and 35448 transitions. Second operand 10 states. [2019-09-07 21:01:09,655 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-09-07 21:01:10,433 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-09-07 21:01:13,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:01:13,149 INFO L93 Difference]: Finished difference Result 83807 states and 91406 transitions. [2019-09-07 21:01:13,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-07 21:01:13,150 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 928 [2019-09-07 21:01:13,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:01:13,248 INFO L225 Difference]: With dead ends: 83807 [2019-09-07 21:01:13,248 INFO L226 Difference]: Without dead ends: 52808 [2019-09-07 21:01:13,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1036 GetRequests, 977 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1228 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=625, Invalid=3035, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 21:01:13,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52808 states. [2019-09-07 21:01:14,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52808 to 43133. [2019-09-07 21:01:14,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43133 states. [2019-09-07 21:01:14,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43133 states to 43133 states and 46977 transitions. [2019-09-07 21:01:14,054 INFO L78 Accepts]: Start accepts. Automaton has 43133 states and 46977 transitions. Word has length 928 [2019-09-07 21:01:14,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:01:14,055 INFO L475 AbstractCegarLoop]: Abstraction has 43133 states and 46977 transitions. [2019-09-07 21:01:14,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 21:01:14,055 INFO L276 IsEmpty]: Start isEmpty. Operand 43133 states and 46977 transitions. [2019-09-07 21:01:14,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 958 [2019-09-07 21:01:14,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:01:14,072 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, 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, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:01:14,073 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:01:14,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:01:14,073 INFO L82 PathProgramCache]: Analyzing trace with hash 62428655, now seen corresponding path program 1 times [2019-09-07 21:01:14,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:01:14,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:01:14,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:01:14,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:01:14,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:01:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:01:15,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1639 backedges. 1003 proven. 110 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-09-07 21:01:15,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:01:15,652 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:01:15,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:01:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:01:15,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 1250 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 21:01:15,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:01:15,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:15,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:59,786 WARN L188 SmtUtils]: Spent 41.59 s on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2019-09-07 21:02:01,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-09-07 21:02:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1639 backedges. 762 proven. 52 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2019-09-07 21:02:02,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:02:02,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2019-09-07 21:02:02,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 21:02:02,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 21:02:02,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=96, Unknown=1, NotChecked=0, Total=132 [2019-09-07 21:02:02,468 INFO L87 Difference]: Start difference. First operand 43133 states and 46977 transitions. Second operand 12 states. [2019-09-07 21:02:44,698 WARN L188 SmtUtils]: Spent 40.42 s on a formula simplification that was a NOOP. DAG size: 67 [2019-09-07 21:03:05,554 WARN L188 SmtUtils]: Spent 20.30 s on a formula simplification that was a NOOP. DAG size: 66 [2019-09-07 21:03:53,165 WARN L188 SmtUtils]: Spent 42.39 s on a formula simplification that was a NOOP. DAG size: 64 [2019-09-07 21:04:29,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:04:29,361 INFO L93 Difference]: Finished difference Result 97271 states and 106876 transitions. [2019-09-07 21:04:29,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 21:04:29,362 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 957 [2019-09-07 21:04:29,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:04:29,469 INFO L225 Difference]: With dead ends: 97271 [2019-09-07 21:04:29,469 INFO L226 Difference]: Without dead ends: 56002 [2019-09-07 21:04:29,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1000 GetRequests, 970 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 161.5s TimeCoverageRelationStatistics Valid=248, Invalid=615, Unknown=7, NotChecked=0, Total=870 [2019-09-07 21:04:29,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56002 states. [2019-09-07 21:04:30,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56002 to 49991. [2019-09-07 21:04:30,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49991 states. [2019-09-07 21:04:30,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49991 states to 49991 states and 54043 transitions. [2019-09-07 21:04:30,365 INFO L78 Accepts]: Start accepts. Automaton has 49991 states and 54043 transitions. Word has length 957 [2019-09-07 21:04:30,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:04:30,365 INFO L475 AbstractCegarLoop]: Abstraction has 49991 states and 54043 transitions. [2019-09-07 21:04:30,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 21:04:30,365 INFO L276 IsEmpty]: Start isEmpty. Operand 49991 states and 54043 transitions. [2019-09-07 21:04:30,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1041 [2019-09-07 21:04:30,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:04:30,392 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 21:04:30,392 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:04:30,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:04:30,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1320174552, now seen corresponding path program 1 times [2019-09-07 21:04:30,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:04:30,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:04:30,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:04:30,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:04:30,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:04:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:04:31,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1700 backedges. 996 proven. 110 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2019-09-07 21:04:31,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:04:31,482 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:04:31,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:04:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:04:31,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 1334 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 21:04:31,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:04:31,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:04:31,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:04:35,584 WARN L188 SmtUtils]: Spent 3.76 s on a formula simplification that was a NOOP. DAG size: 25 [2019-09-07 21:04:35,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:04:36,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1700 backedges. 658 proven. 52 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-07 21:04:36,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:04:36,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2019-09-07 21:04:36,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 21:04:36,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 21:04:36,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-09-07 21:04:36,009 INFO L87 Difference]: Start difference. First operand 49991 states and 54043 transitions. Second operand 12 states. [2019-09-07 21:04:43,294 WARN L188 SmtUtils]: Spent 4.09 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-07 21:04:48,778 WARN L188 SmtUtils]: Spent 3.22 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-07 21:04:51,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:04:51,414 INFO L93 Difference]: Finished difference Result 119806 states and 130175 transitions. [2019-09-07 21:04:51,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 21:04:51,416 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1040 [2019-09-07 21:04:51,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:04:51,542 INFO L225 Difference]: With dead ends: 119806 [2019-09-07 21:04:51,542 INFO L226 Difference]: Without dead ends: 71681 [2019-09-07 21:04:51,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1077 GetRequests, 1050 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=211, Invalid=491, Unknown=0, NotChecked=0, Total=702 [2019-09-07 21:04:51,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71681 states. [2019-09-07 21:04:52,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71681 to 65579. [2019-09-07 21:04:52,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65579 states. [2019-09-07 21:04:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65579 states to 65579 states and 70430 transitions. [2019-09-07 21:04:52,759 INFO L78 Accepts]: Start accepts. Automaton has 65579 states and 70430 transitions. Word has length 1040 [2019-09-07 21:04:52,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:04:52,760 INFO L475 AbstractCegarLoop]: Abstraction has 65579 states and 70430 transitions. [2019-09-07 21:04:52,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 21:04:52,760 INFO L276 IsEmpty]: Start isEmpty. Operand 65579 states and 70430 transitions. [2019-09-07 21:04:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1129 [2019-09-07 21:04:52,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:04:52,799 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:04:52,799 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:04:52,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:04:52,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1137739863, now seen corresponding path program 1 times [2019-09-07 21:04:52,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:04:52,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:04:52,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:04:52,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:04:52,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:04:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:04:55,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1915 backedges. 995 proven. 358 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2019-09-07 21:04:55,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:04:55,981 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 21:04:55,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:04:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:04:56,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 1421 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 21:04:56,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:04:56,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:04:56,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:04:56,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:04:56,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:04:56,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:04:56,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:04:56,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:04:56,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:05:26,826 WARN L188 SmtUtils]: Spent 28.37 s on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-07 21:05:29,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-09-07 21:05:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1915 backedges. 773 proven. 52 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2019-09-07 21:05:34,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:05:34,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2019-09-07 21:05:34,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 21:05:34,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 21:05:34,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=169, Unknown=3, NotChecked=0, Total=210 [2019-09-07 21:05:34,240 INFO L87 Difference]: Start difference. First operand 65579 states and 70430 transitions. Second operand 15 states.