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/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 07:07:27,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 07:07:27,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 07:07:27,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 07:07:27,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 07:07:27,988 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 07:07:27,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 07:07:28,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 07:07:28,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 07:07:28,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 07:07:28,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 07:07:28,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 07:07:28,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 07:07:28,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 07:07:28,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 07:07:28,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 07:07:28,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 07:07:28,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 07:07:28,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 07:07:28,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 07:07:28,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 07:07:28,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 07:07:28,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 07:07:28,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 07:07:28,038 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 07:07:28,038 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 07:07:28,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 07:07:28,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 07:07:28,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 07:07:28,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 07:07:28,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 07:07:28,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 07:07:28,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 07:07:28,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 07:07:28,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 07:07:28,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 07:07:28,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 07:07:28,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 07:07:28,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 07:07:28,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 07:07:28,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 07:07:28,054 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-08 07:07:28,079 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 07:07:28,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 07:07:28,082 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 07:07:28,082 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 07:07:28,082 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 07:07:28,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 07:07:28,083 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 07:07:28,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 07:07:28,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 07:07:28,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 07:07:28,085 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 07:07:28,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 07:07:28,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 07:07:28,086 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 07:07:28,086 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 07:07:28,086 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 07:07:28,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 07:07:28,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 07:07:28,087 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 07:07:28,087 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 07:07:28,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 07:07:28,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 07:07:28,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 07:07:28,088 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 07:07:28,088 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 07:07:28,089 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 07:07:28,089 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 07:07:28,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 07:07:28,089 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 07:07:28,142 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 07:07:28,162 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 07:07:28,166 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 07:07:28,167 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 07:07:28,168 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 07:07:28,168 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2019-09-08 07:07:28,233 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d97253c2b/d37ee65b9041409bb28f9484b4c86d3c/FLAG20138c798 [2019-09-08 07:07:28,696 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 07:07:28,697 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2019-09-08 07:07:28,708 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d97253c2b/d37ee65b9041409bb28f9484b4c86d3c/FLAG20138c798 [2019-09-08 07:07:29,012 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d97253c2b/d37ee65b9041409bb28f9484b4c86d3c [2019-09-08 07:07:29,025 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 07:07:29,027 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 07:07:29,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 07:07:29,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 07:07:29,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 07:07:29,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:07:29" (1/1) ... [2019-09-08 07:07:29,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4556da18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:07:29, skipping insertion in model container [2019-09-08 07:07:29,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:07:29" (1/1) ... [2019-09-08 07:07:29,043 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 07:07:29,100 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 07:07:29,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:07:29,460 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 07:07:29,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:07:29,544 INFO L192 MainTranslator]: Completed translation [2019-09-08 07:07:29,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:07:29 WrapperNode [2019-09-08 07:07:29,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 07:07:29,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 07:07:29,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 07:07:29,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 07:07:29,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:07:29" (1/1) ... [2019-09-08 07:07:29,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:07:29" (1/1) ... [2019-09-08 07:07:29,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:07:29" (1/1) ... [2019-09-08 07:07:29,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:07:29" (1/1) ... [2019-09-08 07:07:29,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:07:29" (1/1) ... [2019-09-08 07:07:29,647 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:07:29" (1/1) ... [2019-09-08 07:07:29,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:07:29" (1/1) ... [2019-09-08 07:07:29,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 07:07:29,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 07:07:29,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 07:07:29,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 07:07:29,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:07:29" (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-08 07:07:29,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 07:07:29,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 07:07:29,728 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-09-08 07:07:29,728 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-09-08 07:07:29,729 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-09-08 07:07:29,729 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-09-08 07:07:29,729 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-09-08 07:07:29,729 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 07:07:29,729 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 07:07:29,730 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-09-08 07:07:29,730 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-09-08 07:07:29,730 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-09-08 07:07:29,732 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-09-08 07:07:29,732 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 07:07:29,733 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 07:07:29,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 07:07:29,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 07:07:29,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 07:07:29,736 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 07:07:29,736 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 07:07:29,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 07:07:29,736 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 07:07:29,737 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-09-08 07:07:29,737 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-09-08 07:07:29,737 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-09-08 07:07:29,737 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-09-08 07:07:29,737 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-09-08 07:07:29,737 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 07:07:29,737 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 07:07:29,738 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-09-08 07:07:29,738 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-09-08 07:07:29,738 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-09-08 07:07:29,739 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-09-08 07:07:29,740 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 07:07:29,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 07:07:29,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 07:07:30,551 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 07:07:30,551 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-08 07:07:30,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:07:30 BoogieIcfgContainer [2019-09-08 07:07:30,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 07:07:30,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 07:07:30,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 07:07:30,559 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 07:07:30,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 07:07:29" (1/3) ... [2019-09-08 07:07:30,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b479cd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:07:30, skipping insertion in model container [2019-09-08 07:07:30,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:07:29" (2/3) ... [2019-09-08 07:07:30,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b479cd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:07:30, skipping insertion in model container [2019-09-08 07:07:30,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:07:30" (3/3) ... [2019-09-08 07:07:30,563 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2019-09-08 07:07:30,574 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 07:07:30,584 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 07:07:30,601 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 07:07:30,640 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 07:07:30,640 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 07:07:30,640 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 07:07:30,641 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 07:07:30,641 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 07:07:30,641 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 07:07:30,641 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 07:07:30,641 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 07:07:30,641 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 07:07:30,666 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2019-09-08 07:07:30,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-08 07:07:30,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:30,677 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] [2019-09-08 07:07:30,679 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:30,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:30,685 INFO L82 PathProgramCache]: Analyzing trace with hash 156755136, now seen corresponding path program 1 times [2019-09-08 07:07:30,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:30,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:30,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:30,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:30,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:30,991 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-08 07:07:30,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:07:30,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:07:31,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:07:31,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:07:31,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:07:31,023 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 4 states. [2019-09-08 07:07:31,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:31,250 INFO L93 Difference]: Finished difference Result 414 states and 677 transitions. [2019-09-08 07:07:31,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:07:31,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-08 07:07:31,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:31,268 INFO L225 Difference]: With dead ends: 414 [2019-09-08 07:07:31,268 INFO L226 Difference]: Without dead ends: 213 [2019-09-08 07:07:31,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:07:31,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-08 07:07:31,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2019-09-08 07:07:31,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-08 07:07:31,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 315 transitions. [2019-09-08 07:07:31,367 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 315 transitions. Word has length 21 [2019-09-08 07:07:31,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:31,368 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 315 transitions. [2019-09-08 07:07:31,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:07:31,368 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 315 transitions. [2019-09-08 07:07:31,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-08 07:07:31,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:31,371 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] [2019-09-08 07:07:31,371 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:31,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:31,372 INFO L82 PathProgramCache]: Analyzing trace with hash 315469091, now seen corresponding path program 1 times [2019-09-08 07:07:31,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:31,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:31,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:31,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:31,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:31,494 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-08 07:07:31,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:07:31,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:07:31,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:07:31,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:07:31,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:07:31,500 INFO L87 Difference]: Start difference. First operand 211 states and 315 transitions. Second operand 4 states. [2019-09-08 07:07:31,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:31,576 INFO L93 Difference]: Finished difference Result 429 states and 647 transitions. [2019-09-08 07:07:31,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:07:31,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-09-08 07:07:31,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:31,586 INFO L225 Difference]: With dead ends: 429 [2019-09-08 07:07:31,586 INFO L226 Difference]: Without dead ends: 227 [2019-09-08 07:07:31,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:07:31,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-08 07:07:31,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-09-08 07:07:31,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-08 07:07:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 331 transitions. [2019-09-08 07:07:31,635 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 331 transitions. Word has length 22 [2019-09-08 07:07:31,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:31,636 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 331 transitions. [2019-09-08 07:07:31,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:07:31,636 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 331 transitions. [2019-09-08 07:07:31,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 07:07:31,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:31,640 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:07:31,640 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:31,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:31,640 INFO L82 PathProgramCache]: Analyzing trace with hash -642611394, now seen corresponding path program 1 times [2019-09-08 07:07:31,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:31,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:31,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:31,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:31,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:31,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:07:31,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:07:31,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 07:07:31,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 07:07:31,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 07:07:31,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:07:31,736 INFO L87 Difference]: Start difference. First operand 224 states and 331 transitions. Second operand 3 states. [2019-09-08 07:07:31,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:31,782 INFO L93 Difference]: Finished difference Result 461 states and 693 transitions. [2019-09-08 07:07:31,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 07:07:31,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-08 07:07:31,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:31,791 INFO L225 Difference]: With dead ends: 461 [2019-09-08 07:07:31,791 INFO L226 Difference]: Without dead ends: 253 [2019-09-08 07:07:31,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-08 07:07:31,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-09-08 07:07:31,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 226. [2019-09-08 07:07:31,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-08 07:07:31,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 333 transitions. [2019-09-08 07:07:31,814 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 333 transitions. Word has length 30 [2019-09-08 07:07:31,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:31,816 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 333 transitions. [2019-09-08 07:07:31,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 07:07:31,816 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 333 transitions. [2019-09-08 07:07:31,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-08 07:07:31,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:31,820 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 07:07:31,820 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:31,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:31,821 INFO L82 PathProgramCache]: Analyzing trace with hash 685674253, now seen corresponding path program 1 times [2019-09-08 07:07:31,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:31,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:31,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:31,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:31,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:31,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:07:31,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:07:31,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:07:31,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:07:31,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:07:31,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:07:31,924 INFO L87 Difference]: Start difference. First operand 226 states and 333 transitions. Second operand 5 states. [2019-09-08 07:07:31,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:31,960 INFO L93 Difference]: Finished difference Result 438 states and 651 transitions. [2019-09-08 07:07:31,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:07:31,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-09-08 07:07:31,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:31,964 INFO L225 Difference]: With dead ends: 438 [2019-09-08 07:07:31,964 INFO L226 Difference]: Without dead ends: 234 [2019-09-08 07:07:31,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:07:31,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-08 07:07:31,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2019-09-08 07:07:31,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-09-08 07:07:31,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 337 transitions. [2019-09-08 07:07:32,000 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 337 transitions. Word has length 38 [2019-09-08 07:07:32,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:32,000 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 337 transitions. [2019-09-08 07:07:32,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:07:32,000 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 337 transitions. [2019-09-08 07:07:32,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-08 07:07:32,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:32,008 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:07:32,009 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:32,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:32,009 INFO L82 PathProgramCache]: Analyzing trace with hash 645817878, now seen corresponding path program 1 times [2019-09-08 07:07:32,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:32,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:32,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:32,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:32,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:32,070 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-08 07:07:32,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:07:32,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:07:32,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:07:32,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:07:32,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:07:32,072 INFO L87 Difference]: Start difference. First operand 230 states and 337 transitions. Second operand 4 states. [2019-09-08 07:07:32,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:32,094 INFO L93 Difference]: Finished difference Result 399 states and 590 transitions. [2019-09-08 07:07:32,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:07:32,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-09-08 07:07:32,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:32,097 INFO L225 Difference]: With dead ends: 399 [2019-09-08 07:07:32,097 INFO L226 Difference]: Without dead ends: 226 [2019-09-08 07:07:32,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:07:32,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-08 07:07:32,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2019-09-08 07:07:32,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-08 07:07:32,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 328 transitions. [2019-09-08 07:07:32,111 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 328 transitions. Word has length 39 [2019-09-08 07:07:32,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:32,112 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 328 transitions. [2019-09-08 07:07:32,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:07:32,112 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 328 transitions. [2019-09-08 07:07:32,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-08 07:07:32,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:32,113 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:07:32,114 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:32,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:32,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1318234090, now seen corresponding path program 1 times [2019-09-08 07:07:32,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:32,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:32,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:32,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:32,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 07:07:32,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:07:32,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:07:32,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:07:32,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:07:32,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:07:32,169 INFO L87 Difference]: Start difference. First operand 226 states and 328 transitions. Second operand 4 states. [2019-09-08 07:07:32,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:32,229 INFO L93 Difference]: Finished difference Result 448 states and 660 transitions. [2019-09-08 07:07:32,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:07:32,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-09-08 07:07:32,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:32,232 INFO L225 Difference]: With dead ends: 448 [2019-09-08 07:07:32,232 INFO L226 Difference]: Without dead ends: 245 [2019-09-08 07:07:32,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:07:32,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-09-08 07:07:32,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2019-09-08 07:07:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-08 07:07:32,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 347 transitions. [2019-09-08 07:07:32,248 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 347 transitions. Word has length 41 [2019-09-08 07:07:32,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:32,249 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 347 transitions. [2019-09-08 07:07:32,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:07:32,249 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 347 transitions. [2019-09-08 07:07:32,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-08 07:07:32,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:32,251 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:07:32,251 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:32,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:32,252 INFO L82 PathProgramCache]: Analyzing trace with hash 900515879, now seen corresponding path program 1 times [2019-09-08 07:07:32,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:32,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:32,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:32,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:32,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 07:07:32,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:07:32,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:07:32,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:07:32,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:07:32,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:07:32,322 INFO L87 Difference]: Start difference. First operand 242 states and 347 transitions. Second operand 4 states. [2019-09-08 07:07:32,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:32,388 INFO L93 Difference]: Finished difference Result 468 states and 688 transitions. [2019-09-08 07:07:32,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:07:32,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-09-08 07:07:32,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:32,393 INFO L225 Difference]: With dead ends: 468 [2019-09-08 07:07:32,393 INFO L226 Difference]: Without dead ends: 251 [2019-09-08 07:07:32,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:07:32,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-09-08 07:07:32,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2019-09-08 07:07:32,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-08 07:07:32,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 355 transitions. [2019-09-08 07:07:32,420 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 355 transitions. Word has length 41 [2019-09-08 07:07:32,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:32,420 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 355 transitions. [2019-09-08 07:07:32,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:07:32,421 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 355 transitions. [2019-09-08 07:07:32,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 07:07:32,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:32,424 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:07:32,424 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:32,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:32,425 INFO L82 PathProgramCache]: Analyzing trace with hash -834135960, now seen corresponding path program 1 times [2019-09-08 07:07:32,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:32,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:32,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:32,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:32,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 07:07:32,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:07:32,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:07:32,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:07:32,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:07:32,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:07:32,527 INFO L87 Difference]: Start difference. First operand 249 states and 355 transitions. Second operand 5 states. [2019-09-08 07:07:32,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:32,555 INFO L93 Difference]: Finished difference Result 467 states and 675 transitions. [2019-09-08 07:07:32,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:07:32,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-08 07:07:32,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:32,558 INFO L225 Difference]: With dead ends: 467 [2019-09-08 07:07:32,559 INFO L226 Difference]: Without dead ends: 251 [2019-09-08 07:07:32,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:07:32,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-09-08 07:07:32,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2019-09-08 07:07:32,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-08 07:07:32,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 354 transitions. [2019-09-08 07:07:32,574 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 354 transitions. Word has length 59 [2019-09-08 07:07:32,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:32,575 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 354 transitions. [2019-09-08 07:07:32,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:07:32,575 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 354 transitions. [2019-09-08 07:07:32,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 07:07:32,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:32,576 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:07:32,577 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:32,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:32,577 INFO L82 PathProgramCache]: Analyzing trace with hash -781021989, now seen corresponding path program 1 times [2019-09-08 07:07:32,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:32,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:32,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:32,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:32,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:32,635 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 07:07:32,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:07:32,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:07:32,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:07:32,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:07:32,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:07:32,637 INFO L87 Difference]: Start difference. First operand 249 states and 354 transitions. Second operand 4 states. [2019-09-08 07:07:32,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:32,713 INFO L93 Difference]: Finished difference Result 481 states and 697 transitions. [2019-09-08 07:07:32,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:07:32,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-08 07:07:32,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:32,717 INFO L225 Difference]: With dead ends: 481 [2019-09-08 07:07:32,717 INFO L226 Difference]: Without dead ends: 270 [2019-09-08 07:07:32,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:07:32,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-09-08 07:07:32,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2019-09-08 07:07:32,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-09-08 07:07:32,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 375 transitions. [2019-09-08 07:07:32,733 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 375 transitions. Word has length 62 [2019-09-08 07:07:32,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:32,734 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 375 transitions. [2019-09-08 07:07:32,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:07:32,734 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 375 transitions. [2019-09-08 07:07:32,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 07:07:32,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:32,736 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-08 07:07:32,736 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:32,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:32,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1793858911, now seen corresponding path program 1 times [2019-09-08 07:07:32,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:32,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:32,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:32,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:32,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:32,799 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 07:07:32,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:07:32,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:07:32,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:07:32,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:07:32,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:07:32,801 INFO L87 Difference]: Start difference. First operand 267 states and 375 transitions. Second operand 4 states. [2019-09-08 07:07:32,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:32,863 INFO L93 Difference]: Finished difference Result 488 states and 701 transitions. [2019-09-08 07:07:32,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:07:32,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-08 07:07:32,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:32,867 INFO L225 Difference]: With dead ends: 488 [2019-09-08 07:07:32,867 INFO L226 Difference]: Without dead ends: 261 [2019-09-08 07:07:32,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:07:32,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-09-08 07:07:32,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2019-09-08 07:07:32,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-08 07:07:32,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 361 transitions. [2019-09-08 07:07:32,884 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 361 transitions. Word has length 63 [2019-09-08 07:07:32,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:32,884 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 361 transitions. [2019-09-08 07:07:32,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:07:32,885 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 361 transitions. [2019-09-08 07:07:32,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 07:07:32,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:32,886 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:07:32,887 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:32,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:32,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1211522460, now seen corresponding path program 1 times [2019-09-08 07:07:32,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:32,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:32,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:32,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:32,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:32,959 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 07:07:32,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:07:32,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:07:32,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:07:32,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:07:32,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:07:32,963 INFO L87 Difference]: Start difference. First operand 261 states and 361 transitions. Second operand 5 states. [2019-09-08 07:07:32,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:32,991 INFO L93 Difference]: Finished difference Result 475 states and 668 transitions. [2019-09-08 07:07:32,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:07:32,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 07:07:32,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:32,996 INFO L225 Difference]: With dead ends: 475 [2019-09-08 07:07:32,997 INFO L226 Difference]: Without dead ends: 263 [2019-09-08 07:07:32,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:07:33,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-09-08 07:07:33,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2019-09-08 07:07:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-08 07:07:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 360 transitions. [2019-09-08 07:07:33,016 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 360 transitions. Word has length 82 [2019-09-08 07:07:33,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:33,018 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 360 transitions. [2019-09-08 07:07:33,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:07:33,018 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 360 transitions. [2019-09-08 07:07:33,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 07:07:33,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:33,020 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:07:33,020 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:33,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:33,020 INFO L82 PathProgramCache]: Analyzing trace with hash -203961561, now seen corresponding path program 1 times [2019-09-08 07:07:33,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:33,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:33,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:33,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:33,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:33,110 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-08 07:07:33,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:07:33,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:07:33,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:07:33,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:07:33,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:07:33,112 INFO L87 Difference]: Start difference. First operand 261 states and 360 transitions. Second operand 4 states. [2019-09-08 07:07:33,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:33,179 INFO L93 Difference]: Finished difference Result 464 states and 666 transitions. [2019-09-08 07:07:33,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:07:33,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-08 07:07:33,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:33,182 INFO L225 Difference]: With dead ends: 464 [2019-09-08 07:07:33,182 INFO L226 Difference]: Without dead ends: 259 [2019-09-08 07:07:33,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:07:33,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-09-08 07:07:33,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2019-09-08 07:07:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-08 07:07:33,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 356 transitions. [2019-09-08 07:07:33,196 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 356 transitions. Word has length 85 [2019-09-08 07:07:33,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:33,197 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 356 transitions. [2019-09-08 07:07:33,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:07:33,197 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 356 transitions. [2019-09-08 07:07:33,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 07:07:33,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:33,201 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:07:33,201 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:33,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:33,201 INFO L82 PathProgramCache]: Analyzing trace with hash 567785346, now seen corresponding path program 1 times [2019-09-08 07:07:33,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:33,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:33,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:33,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:33,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 07:07:33,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:07:33,286 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-08 07:07:33,323 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-08 07:07:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:33,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 07:07:33,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:07:33,532 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 51 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-08 07:07:33,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:07:33,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-09-08 07:07:33,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:07:33,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:07:33,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:07:33,548 INFO L87 Difference]: Start difference. First operand 259 states and 356 transitions. Second operand 6 states. [2019-09-08 07:07:33,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:33,736 INFO L93 Difference]: Finished difference Result 614 states and 856 transitions. [2019-09-08 07:07:33,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 07:07:33,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-09-08 07:07:33,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:33,740 INFO L225 Difference]: With dead ends: 614 [2019-09-08 07:07:33,740 INFO L226 Difference]: Without dead ends: 298 [2019-09-08 07:07:33,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:07:33,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-08 07:07:33,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 268. [2019-09-08 07:07:33,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-08 07:07:33,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 357 transitions. [2019-09-08 07:07:33,760 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 357 transitions. Word has length 100 [2019-09-08 07:07:33,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:33,760 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 357 transitions. [2019-09-08 07:07:33,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:07:33,760 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 357 transitions. [2019-09-08 07:07:33,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 07:07:33,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:33,763 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:07:33,763 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:33,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:33,763 INFO L82 PathProgramCache]: Analyzing trace with hash -837182129, now seen corresponding path program 1 times [2019-09-08 07:07:33,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:33,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:33,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:33,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:33,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:33,877 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-09-08 07:07:33,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:07:33,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:07:33,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:07:33,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:07:33,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:07:33,879 INFO L87 Difference]: Start difference. First operand 268 states and 357 transitions. Second operand 5 states. [2019-09-08 07:07:33,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:33,903 INFO L93 Difference]: Finished difference Result 440 states and 604 transitions. [2019-09-08 07:07:33,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:07:33,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 07:07:33,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:33,907 INFO L225 Difference]: With dead ends: 440 [2019-09-08 07:07:33,907 INFO L226 Difference]: Without dead ends: 268 [2019-09-08 07:07:33,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:07:33,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-09-08 07:07:33,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2019-09-08 07:07:33,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-08 07:07:33,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 355 transitions. [2019-09-08 07:07:33,922 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 355 transitions. Word has length 144 [2019-09-08 07:07:33,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:33,922 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 355 transitions. [2019-09-08 07:07:33,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:07:33,922 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 355 transitions. [2019-09-08 07:07:33,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 07:07:33,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:33,925 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:07:33,926 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:33,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:33,926 INFO L82 PathProgramCache]: Analyzing trace with hash 125735935, now seen corresponding path program 1 times [2019-09-08 07:07:33,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:33,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:33,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:33,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:33,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-09-08 07:07:34,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:07:34,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:07:34,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:07:34,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:07:34,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:07:34,097 INFO L87 Difference]: Start difference. First operand 268 states and 355 transitions. Second operand 4 states. [2019-09-08 07:07:34,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:34,157 INFO L93 Difference]: Finished difference Result 439 states and 604 transitions. [2019-09-08 07:07:34,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:07:34,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-08 07:07:34,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:34,161 INFO L225 Difference]: With dead ends: 439 [2019-09-08 07:07:34,161 INFO L226 Difference]: Without dead ends: 274 [2019-09-08 07:07:34,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:07:34,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-08 07:07:34,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2019-09-08 07:07:34,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-08 07:07:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 358 transitions. [2019-09-08 07:07:34,179 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 358 transitions. Word has length 161 [2019-09-08 07:07:34,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:34,180 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 358 transitions. [2019-09-08 07:07:34,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:07:34,180 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 358 transitions. [2019-09-08 07:07:34,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 07:07:34,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:34,184 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:07:34,186 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:34,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:34,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1479773436, now seen corresponding path program 1 times [2019-09-08 07:07:34,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:34,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:34,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:34,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:34,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:34,358 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-09-08 07:07:34,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:07:34,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:07:34,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:07:34,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:07:34,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:07:34,363 INFO L87 Difference]: Start difference. First operand 272 states and 358 transitions. Second operand 4 states. [2019-09-08 07:07:34,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:34,417 INFO L93 Difference]: Finished difference Result 448 states and 611 transitions. [2019-09-08 07:07:34,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:07:34,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-08 07:07:34,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:34,423 INFO L225 Difference]: With dead ends: 448 [2019-09-08 07:07:34,423 INFO L226 Difference]: Without dead ends: 279 [2019-09-08 07:07:34,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:07:34,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-09-08 07:07:34,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2019-09-08 07:07:34,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-09-08 07:07:34,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 362 transitions. [2019-09-08 07:07:34,438 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 362 transitions. Word has length 173 [2019-09-08 07:07:34,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:34,441 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 362 transitions. [2019-09-08 07:07:34,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:07:34,441 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 362 transitions. [2019-09-08 07:07:34,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 07:07:34,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:34,444 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:07:34,444 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:34,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:34,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1136138834, now seen corresponding path program 1 times [2019-09-08 07:07:34,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:34,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:34,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:34,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:34,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:34,586 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2019-09-08 07:07:34,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:07:34,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:07:34,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:07:34,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:07:34,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:07:34,588 INFO L87 Difference]: Start difference. First operand 277 states and 362 transitions. Second operand 4 states. [2019-09-08 07:07:34,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:34,626 INFO L93 Difference]: Finished difference Result 450 states and 609 transitions. [2019-09-08 07:07:34,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:07:34,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-09-08 07:07:34,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:34,629 INFO L225 Difference]: With dead ends: 450 [2019-09-08 07:07:34,629 INFO L226 Difference]: Without dead ends: 276 [2019-09-08 07:07:34,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:07:34,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-09-08 07:07:34,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2019-09-08 07:07:34,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-09-08 07:07:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 357 transitions. [2019-09-08 07:07:34,645 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 357 transitions. Word has length 186 [2019-09-08 07:07:34,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:34,649 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 357 transitions. [2019-09-08 07:07:34,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:07:34,649 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 357 transitions. [2019-09-08 07:07:34,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 07:07:34,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:34,653 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:07:34,654 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:34,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:34,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1490535132, now seen corresponding path program 1 times [2019-09-08 07:07:34,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:34,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:34,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:34,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:34,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:34,826 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-09-08 07:07:34,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:07:34,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:07:34,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:07:34,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:07:34,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:07:34,829 INFO L87 Difference]: Start difference. First operand 276 states and 357 transitions. Second operand 4 states. [2019-09-08 07:07:34,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:34,858 INFO L93 Difference]: Finished difference Result 448 states and 599 transitions. [2019-09-08 07:07:34,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:07:34,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-09-08 07:07:34,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:34,861 INFO L225 Difference]: With dead ends: 448 [2019-09-08 07:07:34,861 INFO L226 Difference]: Without dead ends: 275 [2019-09-08 07:07:34,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:07:34,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-08 07:07:34,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2019-09-08 07:07:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-09-08 07:07:34,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 354 transitions. [2019-09-08 07:07:34,875 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 354 transitions. Word has length 200 [2019-09-08 07:07:34,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:34,876 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 354 transitions. [2019-09-08 07:07:34,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:07:34,876 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 354 transitions. [2019-09-08 07:07:34,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-08 07:07:34,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:34,879 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:07:34,879 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:34,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:34,880 INFO L82 PathProgramCache]: Analyzing trace with hash 978487733, now seen corresponding path program 1 times [2019-09-08 07:07:34,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:34,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:34,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:34,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:34,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:34,994 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-09-08 07:07:34,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:07:34,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:07:34,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:07:34,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:07:34,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:07:34,997 INFO L87 Difference]: Start difference. First operand 275 states and 354 transitions. Second operand 4 states. [2019-09-08 07:07:35,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:35,407 INFO L93 Difference]: Finished difference Result 766 states and 1033 transitions. [2019-09-08 07:07:35,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:07:35,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-09-08 07:07:35,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:35,413 INFO L225 Difference]: With dead ends: 766 [2019-09-08 07:07:35,413 INFO L226 Difference]: Without dead ends: 594 [2019-09-08 07:07:35,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:07:35,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-09-08 07:07:35,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 458. [2019-09-08 07:07:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-09-08 07:07:35,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 614 transitions. [2019-09-08 07:07:35,439 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 614 transitions. Word has length 201 [2019-09-08 07:07:35,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:35,441 INFO L475 AbstractCegarLoop]: Abstraction has 458 states and 614 transitions. [2019-09-08 07:07:35,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:07:35,441 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 614 transitions. [2019-09-08 07:07:35,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 07:07:35,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:35,446 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:07:35,446 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:35,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:35,446 INFO L82 PathProgramCache]: Analyzing trace with hash -139085571, now seen corresponding path program 1 times [2019-09-08 07:07:35,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:35,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:35,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:35,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:35,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-09-08 07:07:35,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:07:35,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:07:35,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:07:35,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:07:35,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:07:35,631 INFO L87 Difference]: Start difference. First operand 458 states and 614 transitions. Second operand 4 states. [2019-09-08 07:07:35,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:35,922 INFO L93 Difference]: Finished difference Result 1178 states and 1627 transitions. [2019-09-08 07:07:35,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:07:35,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-09-08 07:07:35,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:35,929 INFO L225 Difference]: With dead ends: 1178 [2019-09-08 07:07:35,929 INFO L226 Difference]: Without dead ends: 823 [2019-09-08 07:07:35,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:07:35,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2019-09-08 07:07:35,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 809. [2019-09-08 07:07:35,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2019-09-08 07:07:35,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1096 transitions. [2019-09-08 07:07:35,985 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1096 transitions. Word has length 237 [2019-09-08 07:07:35,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:35,985 INFO L475 AbstractCegarLoop]: Abstraction has 809 states and 1096 transitions. [2019-09-08 07:07:35,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:07:35,986 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1096 transitions. [2019-09-08 07:07:35,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-08 07:07:35,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:35,993 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:07:35,993 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:35,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:35,994 INFO L82 PathProgramCache]: Analyzing trace with hash -188437350, now seen corresponding path program 1 times [2019-09-08 07:07:35,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:35,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:35,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:35,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:35,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:36,127 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-09-08 07:07:36,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:07:36,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:07:36,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:07:36,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:07:36,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:07:36,129 INFO L87 Difference]: Start difference. First operand 809 states and 1096 transitions. Second operand 4 states. [2019-09-08 07:07:36,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:36,426 INFO L93 Difference]: Finished difference Result 2159 states and 2996 transitions. [2019-09-08 07:07:36,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:07:36,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-09-08 07:07:36,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:36,437 INFO L225 Difference]: With dead ends: 2159 [2019-09-08 07:07:36,437 INFO L226 Difference]: Without dead ends: 1480 [2019-09-08 07:07:36,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:07:36,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2019-09-08 07:07:36,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1117. [2019-09-08 07:07:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2019-09-08 07:07:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1526 transitions. [2019-09-08 07:07:36,531 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1526 transitions. Word has length 238 [2019-09-08 07:07:36,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:36,532 INFO L475 AbstractCegarLoop]: Abstraction has 1117 states and 1526 transitions. [2019-09-08 07:07:36,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:07:36,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1526 transitions. [2019-09-08 07:07:36,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 07:07:36,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:36,543 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:07:36,544 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:36,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:36,544 INFO L82 PathProgramCache]: Analyzing trace with hash -257797915, now seen corresponding path program 1 times [2019-09-08 07:07:36,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:36,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:36,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:36,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:36,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:36,814 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2019-09-08 07:07:36,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:07:36,814 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-08 07:07:36,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:37,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 07:07:37,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:07:37,222 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 96 proven. 8 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-09-08 07:07:37,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:07:37,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-08 07:07:37,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:07:37,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:07:37,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:07:37,239 INFO L87 Difference]: Start difference. First operand 1117 states and 1526 transitions. Second operand 10 states. [2019-09-08 07:07:37,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:37,550 INFO L93 Difference]: Finished difference Result 2302 states and 3175 transitions. [2019-09-08 07:07:37,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:07:37,554 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 239 [2019-09-08 07:07:37,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:37,563 INFO L225 Difference]: With dead ends: 2302 [2019-09-08 07:07:37,563 INFO L226 Difference]: Without dead ends: 1144 [2019-09-08 07:07:37,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:07:37,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-09-08 07:07:37,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1144. [2019-09-08 07:07:37,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2019-09-08 07:07:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1524 transitions. [2019-09-08 07:07:37,682 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1524 transitions. Word has length 239 [2019-09-08 07:07:37,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:37,682 INFO L475 AbstractCegarLoop]: Abstraction has 1144 states and 1524 transitions. [2019-09-08 07:07:37,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:07:37,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1524 transitions. [2019-09-08 07:07:37,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-08 07:07:37,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:37,691 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 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, 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] [2019-09-08 07:07:37,691 INFO L418 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:37,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:37,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1345853168, now seen corresponding path program 1 times [2019-09-08 07:07:37,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:37,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:37,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:37,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:37,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:37,917 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2019-09-08 07:07:37,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:07:37,919 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:07:37,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:38,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 07:07:38,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:07:38,252 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-08 07:07:38,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:07:38,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-09-08 07:07:38,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:07:38,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:07:38,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:07:38,266 INFO L87 Difference]: Start difference. First operand 1144 states and 1524 transitions. Second operand 9 states. [2019-09-08 07:07:38,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:38,464 INFO L93 Difference]: Finished difference Result 2211 states and 3056 transitions. [2019-09-08 07:07:38,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 07:07:38,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 293 [2019-09-08 07:07:38,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:38,474 INFO L225 Difference]: With dead ends: 2211 [2019-09-08 07:07:38,474 INFO L226 Difference]: Without dead ends: 1188 [2019-09-08 07:07:38,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:07:38,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2019-09-08 07:07:38,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1188. [2019-09-08 07:07:38,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1188 states. [2019-09-08 07:07:38,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1557 transitions. [2019-09-08 07:07:38,593 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1557 transitions. Word has length 293 [2019-09-08 07:07:38,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:38,594 INFO L475 AbstractCegarLoop]: Abstraction has 1188 states and 1557 transitions. [2019-09-08 07:07:38,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:07:38,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1557 transitions. [2019-09-08 07:07:38,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-08 07:07:38,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:38,601 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:07:38,601 INFO L418 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:38,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:38,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1460929737, now seen corresponding path program 1 times [2019-09-08 07:07:38,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:38,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:38,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:38,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:38,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-09-08 07:07:38,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:07:38,891 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-08 07:07:38,907 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-08 07:07:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:39,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 07:07:39,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:07:39,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 07:07:39,320 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2019-09-08 07:07:39,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:07:39,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2019-09-08 07:07:39,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 07:07:39,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 07:07:39,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-08 07:07:39,334 INFO L87 Difference]: Start difference. First operand 1188 states and 1557 transitions. Second operand 15 states. [2019-09-08 07:07:39,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:39,605 INFO L93 Difference]: Finished difference Result 1249 states and 1664 transitions. [2019-09-08 07:07:39,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 07:07:39,606 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 294 [2019-09-08 07:07:39,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:39,615 INFO L225 Difference]: With dead ends: 1249 [2019-09-08 07:07:39,615 INFO L226 Difference]: Without dead ends: 1247 [2019-09-08 07:07:39,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-09-08 07:07:39,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2019-09-08 07:07:39,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1212. [2019-09-08 07:07:39,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2019-09-08 07:07:39,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1584 transitions. [2019-09-08 07:07:39,704 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1584 transitions. Word has length 294 [2019-09-08 07:07:39,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:39,706 INFO L475 AbstractCegarLoop]: Abstraction has 1212 states and 1584 transitions. [2019-09-08 07:07:39,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 07:07:39,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1584 transitions. [2019-09-08 07:07:39,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 07:07:39,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:39,714 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 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, 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] [2019-09-08 07:07:39,714 INFO L418 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:39,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:39,715 INFO L82 PathProgramCache]: Analyzing trace with hash -2110556157, now seen corresponding path program 1 times [2019-09-08 07:07:39,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:39,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:39,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:39,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:39,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:40,063 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2019-09-08 07:07:40,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:07:40,063 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-08 07:07:40,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:40,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 07:07:40,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:07:40,679 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 251 proven. 33 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 07:07:40,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:07:40,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2019-09-08 07:07:40,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 07:07:40,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 07:07:40,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-09-08 07:07:40,688 INFO L87 Difference]: Start difference. First operand 1212 states and 1584 transitions. Second operand 21 states. [2019-09-08 07:07:47,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:47,016 INFO L93 Difference]: Finished difference Result 4419 states and 5933 transitions. [2019-09-08 07:07:47,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 07:07:47,017 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 302 [2019-09-08 07:07:47,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:47,037 INFO L225 Difference]: With dead ends: 4419 [2019-09-08 07:07:47,038 INFO L226 Difference]: Without dead ends: 3363 [2019-09-08 07:07:47,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=194, Invalid=1446, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 07:07:47,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3363 states. [2019-09-08 07:07:47,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3363 to 2916. [2019-09-08 07:07:47,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2916 states. [2019-09-08 07:07:47,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 3884 transitions. [2019-09-08 07:07:47,235 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 3884 transitions. Word has length 302 [2019-09-08 07:07:47,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:47,236 INFO L475 AbstractCegarLoop]: Abstraction has 2916 states and 3884 transitions. [2019-09-08 07:07:47,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 07:07:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 3884 transitions. [2019-09-08 07:07:47,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 07:07:47,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:47,251 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 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, 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] [2019-09-08 07:07:47,251 INFO L418 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:47,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:47,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1417454460, now seen corresponding path program 1 times [2019-09-08 07:07:47,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:47,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:47,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:47,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:47,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:47,575 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2019-09-08 07:07:47,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:07:47,576 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-08 07:07:47,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:47,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 07:07:47,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:07:47,837 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Stream closed [2019-09-08 07:07:47,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:07:47,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2019-09-08 07:07:47,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:07:47,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:07:47,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:07:47,854 INFO L87 Difference]: Start difference. First operand 2916 states and 3884 transitions. Second operand 4 states. [2019-09-08 07:07:48,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:48,005 INFO L93 Difference]: Finished difference Result 4629 states and 6044 transitions. [2019-09-08 07:07:48,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:07:48,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2019-09-08 07:07:48,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:48,019 INFO L225 Difference]: With dead ends: 4629 [2019-09-08 07:07:48,020 INFO L226 Difference]: Without dead ends: 2403 [2019-09-08 07:07:48,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:07:48,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2019-09-08 07:07:48,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 2403. [2019-09-08 07:07:48,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2403 states. [2019-09-08 07:07:48,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2403 states and 3053 transitions. [2019-09-08 07:07:48,157 INFO L78 Accepts]: Start accepts. Automaton has 2403 states and 3053 transitions. Word has length 302 [2019-09-08 07:07:48,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:48,157 INFO L475 AbstractCegarLoop]: Abstraction has 2403 states and 3053 transitions. [2019-09-08 07:07:48,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:07:48,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 3053 transitions. [2019-09-08 07:07:48,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-08 07:07:48,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:48,165 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:07:48,165 INFO L418 AbstractCegarLoop]: === Iteration 27 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:48,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:48,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1655587381, now seen corresponding path program 1 times [2019-09-08 07:07:48,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:48,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:48,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:48,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:48,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:48,341 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-08 07:07:48,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:07:48,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:07:48,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:07:48,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:07:48,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:07:48,343 INFO L87 Difference]: Start difference. First operand 2403 states and 3053 transitions. Second operand 10 states. [2019-09-08 07:07:48,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:48,957 INFO L93 Difference]: Finished difference Result 5154 states and 6622 transitions. [2019-09-08 07:07:48,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 07:07:48,958 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 317 [2019-09-08 07:07:48,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:48,979 INFO L225 Difference]: With dead ends: 5154 [2019-09-08 07:07:48,979 INFO L226 Difference]: Without dead ends: 3660 [2019-09-08 07:07:48,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-09-08 07:07:48,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2019-09-08 07:07:49,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 3318. [2019-09-08 07:07:49,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3318 states. [2019-09-08 07:07:49,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3318 states to 3318 states and 4252 transitions. [2019-09-08 07:07:49,322 INFO L78 Accepts]: Start accepts. Automaton has 3318 states and 4252 transitions. Word has length 317 [2019-09-08 07:07:49,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:49,323 INFO L475 AbstractCegarLoop]: Abstraction has 3318 states and 4252 transitions. [2019-09-08 07:07:49,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:07:49,324 INFO L276 IsEmpty]: Start isEmpty. Operand 3318 states and 4252 transitions. [2019-09-08 07:07:49,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-08 07:07:49,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:49,341 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:07:49,341 INFO L418 AbstractCegarLoop]: === Iteration 28 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:49,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:49,342 INFO L82 PathProgramCache]: Analyzing trace with hash 252870409, now seen corresponding path program 1 times [2019-09-08 07:07:49,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:49,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:49,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:49,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:49,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:49,623 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-08 07:07:49,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:07:49,624 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 07:07:49,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:49,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 1427 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 07:07:49,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:07:49,976 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2019-09-08 07:07:49,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:07:49,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2019-09-08 07:07:49,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 07:07:49,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 07:07:49,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-08 07:07:49,983 INFO L87 Difference]: Start difference. First operand 3318 states and 4252 transitions. Second operand 14 states. [2019-09-08 07:07:54,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:54,267 INFO L93 Difference]: Finished difference Result 6159 states and 7851 transitions. [2019-09-08 07:07:54,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 07:07:54,268 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 317 [2019-09-08 07:07:54,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:54,289 INFO L225 Difference]: With dead ends: 6159 [2019-09-08 07:07:54,289 INFO L226 Difference]: Without dead ends: 3579 [2019-09-08 07:07:54,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=1210, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 07:07:54,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3579 states. [2019-09-08 07:07:54,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3579 to 2898. [2019-09-08 07:07:54,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2898 states. [2019-09-08 07:07:54,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 3591 transitions. [2019-09-08 07:07:54,436 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 3591 transitions. Word has length 317 [2019-09-08 07:07:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:54,437 INFO L475 AbstractCegarLoop]: Abstraction has 2898 states and 3591 transitions. [2019-09-08 07:07:54,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 07:07:54,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 3591 transitions. [2019-09-08 07:07:54,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 07:07:54,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:54,443 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 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, 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] [2019-09-08 07:07:54,444 INFO L418 AbstractCegarLoop]: === Iteration 29 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:54,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:54,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1853465151, now seen corresponding path program 1 times [2019-09-08 07:07:54,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:54,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:54,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:54,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:54,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:54,626 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-08 07:07:54,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:07:54,626 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-08 07:07:54,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:54,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 1429 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 07:07:54,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:07:55,102 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2019-09-08 07:07:55,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:07:55,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 19 [2019-09-08 07:07:55,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 07:07:55,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 07:07:55,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-09-08 07:07:55,109 INFO L87 Difference]: Start difference. First operand 2898 states and 3591 transitions. Second operand 19 states. [2019-09-08 07:08:02,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:02,180 INFO L93 Difference]: Finished difference Result 5653 states and 7044 transitions. [2019-09-08 07:08:02,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 07:08:02,181 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 318 [2019-09-08 07:08:02,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:02,199 INFO L225 Difference]: With dead ends: 5653 [2019-09-08 07:08:02,199 INFO L226 Difference]: Without dead ends: 3499 [2019-09-08 07:08:02,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=362, Invalid=2718, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 07:08:02,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3499 states. [2019-09-08 07:08:02,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3499 to 2892. [2019-09-08 07:08:02,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2892 states. [2019-09-08 07:08:02,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2892 states to 2892 states and 3546 transitions. [2019-09-08 07:08:02,337 INFO L78 Accepts]: Start accepts. Automaton has 2892 states and 3546 transitions. Word has length 318 [2019-09-08 07:08:02,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:02,337 INFO L475 AbstractCegarLoop]: Abstraction has 2892 states and 3546 transitions. [2019-09-08 07:08:02,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 07:08:02,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2892 states and 3546 transitions. [2019-09-08 07:08:02,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-08 07:08:02,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:02,345 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:08:02,345 INFO L418 AbstractCegarLoop]: === Iteration 30 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:02,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:02,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1554772743, now seen corresponding path program 1 times [2019-09-08 07:08:02,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:02,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:02,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:02,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:02,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2019-09-08 07:08:02,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:08:02,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:08:02,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:08:02,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:08:02,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:08:02,521 INFO L87 Difference]: Start difference. First operand 2892 states and 3546 transitions. Second operand 6 states. [2019-09-08 07:08:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:02,793 INFO L93 Difference]: Finished difference Result 6921 states and 9175 transitions. [2019-09-08 07:08:02,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 07:08:02,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 323 [2019-09-08 07:08:02,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:02,817 INFO L225 Difference]: With dead ends: 6921 [2019-09-08 07:08:02,817 INFO L226 Difference]: Without dead ends: 4851 [2019-09-08 07:08:02,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:08:02,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4851 states. [2019-09-08 07:08:03,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4851 to 3375. [2019-09-08 07:08:03,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3375 states. [2019-09-08 07:08:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3375 states to 3375 states and 4299 transitions. [2019-09-08 07:08:03,033 INFO L78 Accepts]: Start accepts. Automaton has 3375 states and 4299 transitions. Word has length 323 [2019-09-08 07:08:03,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:03,034 INFO L475 AbstractCegarLoop]: Abstraction has 3375 states and 4299 transitions. [2019-09-08 07:08:03,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:08:03,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3375 states and 4299 transitions. [2019-09-08 07:08:03,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-08 07:08:03,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:03,040 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:08:03,041 INFO L418 AbstractCegarLoop]: === Iteration 31 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:03,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:03,041 INFO L82 PathProgramCache]: Analyzing trace with hash -832398973, now seen corresponding path program 1 times [2019-09-08 07:08:03,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:03,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:03,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:03,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:03,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:03,221 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2019-09-08 07:08:03,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:08:03,222 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) [2019-09-08 07:08:03,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:08:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:03,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 07:08:03,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:08:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 07:08:03,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:08:03,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2019-09-08 07:08:03,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 07:08:03,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 07:08:03,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-09-08 07:08:03,622 INFO L87 Difference]: Start difference. First operand 3375 states and 4299 transitions. Second operand 17 states. [2019-09-08 07:08:07,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:07,476 INFO L93 Difference]: Finished difference Result 9018 states and 11533 transitions. [2019-09-08 07:08:07,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 07:08:07,477 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 323 [2019-09-08 07:08:07,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:07,507 INFO L225 Difference]: With dead ends: 9018 [2019-09-08 07:08:07,507 INFO L226 Difference]: Without dead ends: 6522 [2019-09-08 07:08:07,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=388, Invalid=3152, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 07:08:07,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6522 states. [2019-09-08 07:08:07,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6522 to 3714. [2019-09-08 07:08:07,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3714 states. [2019-09-08 07:08:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 4575 transitions. [2019-09-08 07:08:07,735 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 4575 transitions. Word has length 323 [2019-09-08 07:08:07,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:07,736 INFO L475 AbstractCegarLoop]: Abstraction has 3714 states and 4575 transitions. [2019-09-08 07:08:07,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 07:08:07,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 4575 transitions. [2019-09-08 07:08:07,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-08 07:08:07,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:07,743 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:08:07,743 INFO L418 AbstractCegarLoop]: === Iteration 32 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:07,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:07,744 INFO L82 PathProgramCache]: Analyzing trace with hash -377332349, now seen corresponding path program 1 times [2019-09-08 07:08:07,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:07,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:07,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:07,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:07,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:08,360 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-08 07:08:08,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:08:08,360 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-08 07:08:08,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:08,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 07:08:08,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:08:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2019-09-08 07:08:08,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:08:08,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [18] total 26 [2019-09-08 07:08:08,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 07:08:08,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 07:08:08,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2019-09-08 07:08:08,873 INFO L87 Difference]: Start difference. First operand 3714 states and 4575 transitions. Second operand 26 states. [2019-09-08 07:08:17,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:17,113 INFO L93 Difference]: Finished difference Result 8388 states and 10228 transitions. [2019-09-08 07:08:17,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-08 07:08:17,115 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 323 [2019-09-08 07:08:17,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:17,137 INFO L225 Difference]: With dead ends: 8388 [2019-09-08 07:08:17,138 INFO L226 Difference]: Without dead ends: 5577 [2019-09-08 07:08:17,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 321 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=612, Invalid=4218, Unknown=0, NotChecked=0, Total=4830 [2019-09-08 07:08:17,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5577 states. [2019-09-08 07:08:17,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5577 to 3486. [2019-09-08 07:08:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3486 states. [2019-09-08 07:08:17,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 4220 transitions. [2019-09-08 07:08:17,374 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 4220 transitions. Word has length 323 [2019-09-08 07:08:17,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:17,375 INFO L475 AbstractCegarLoop]: Abstraction has 3486 states and 4220 transitions. [2019-09-08 07:08:17,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 07:08:17,376 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 4220 transitions. [2019-09-08 07:08:17,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-08 07:08:17,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:17,384 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:08:17,384 INFO L418 AbstractCegarLoop]: === Iteration 33 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:17,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:17,385 INFO L82 PathProgramCache]: Analyzing trace with hash 358147684, now seen corresponding path program 1 times [2019-09-08 07:08:17,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:17,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:17,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:17,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:17,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-08 07:08:17,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:08:17,589 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-08 07:08:17,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:17,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 1441 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 07:08:17,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:08:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2019-09-08 07:08:17,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:08:17,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2019-09-08 07:08:17,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 07:08:17,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 07:08:17,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-08 07:08:17,926 INFO L87 Difference]: Start difference. First operand 3486 states and 4220 transitions. Second operand 15 states. [2019-09-08 07:08:25,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:25,151 INFO L93 Difference]: Finished difference Result 7806 states and 9534 transitions. [2019-09-08 07:08:25,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 07:08:25,151 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 325 [2019-09-08 07:08:25,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:25,169 INFO L225 Difference]: With dead ends: 7806 [2019-09-08 07:08:25,170 INFO L226 Difference]: Without dead ends: 4890 [2019-09-08 07:08:25,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=305, Invalid=2347, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 07:08:25,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4890 states. [2019-09-08 07:08:25,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4890 to 2943. [2019-09-08 07:08:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2943 states. [2019-09-08 07:08:25,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2943 states to 2943 states and 3526 transitions. [2019-09-08 07:08:25,384 INFO L78 Accepts]: Start accepts. Automaton has 2943 states and 3526 transitions. Word has length 325 [2019-09-08 07:08:25,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:25,385 INFO L475 AbstractCegarLoop]: Abstraction has 2943 states and 3526 transitions. [2019-09-08 07:08:25,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 07:08:25,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2943 states and 3526 transitions. [2019-09-08 07:08:25,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-09-08 07:08:25,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:25,398 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:08:25,399 INFO L418 AbstractCegarLoop]: === Iteration 34 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:25,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:25,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1477512040, now seen corresponding path program 1 times [2019-09-08 07:08:25,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:25,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:25,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:25,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:25,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:25,835 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2019-09-08 07:08:25,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:08:25,836 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) [2019-09-08 07:08:25,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:08:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:26,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 1925 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-08 07:08:26,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:08:26,436 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 228 proven. 96 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-09-08 07:08:26,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:08:26,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2019-09-08 07:08:26,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 07:08:26,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 07:08:26,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-09-08 07:08:26,443 INFO L87 Difference]: Start difference. First operand 2943 states and 3526 transitions. Second operand 25 states. [2019-09-08 07:08:41,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:41,781 INFO L93 Difference]: Finished difference Result 10889 states and 13614 transitions. [2019-09-08 07:08:41,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-08 07:08:41,781 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 395 [2019-09-08 07:08:41,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:41,811 INFO L225 Difference]: With dead ends: 10889 [2019-09-08 07:08:41,811 INFO L226 Difference]: Without dead ends: 8546 [2019-09-08 07:08:41,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 423 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5634 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2267, Invalid=15025, Unknown=0, NotChecked=0, Total=17292 [2019-09-08 07:08:41,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8546 states. [2019-09-08 07:08:42,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8546 to 7114. [2019-09-08 07:08:42,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7114 states. [2019-09-08 07:08:42,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7114 states to 7114 states and 8584 transitions. [2019-09-08 07:08:42,415 INFO L78 Accepts]: Start accepts. Automaton has 7114 states and 8584 transitions. Word has length 395 [2019-09-08 07:08:42,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:42,416 INFO L475 AbstractCegarLoop]: Abstraction has 7114 states and 8584 transitions. [2019-09-08 07:08:42,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 07:08:42,416 INFO L276 IsEmpty]: Start isEmpty. Operand 7114 states and 8584 transitions. [2019-09-08 07:08:42,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-09-08 07:08:42,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:42,435 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:08:42,435 INFO L418 AbstractCegarLoop]: === Iteration 35 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:42,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:42,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1192841611, now seen corresponding path program 1 times [2019-09-08 07:08:42,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:42,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:42,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:42,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:42,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:42,597 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 46 proven. 5 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2019-09-08 07:08:42,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:08:42,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:08:42,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:08:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:42,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 1922 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 07:08:42,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:08:42,932 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2019-09-08 07:08:42,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:08:42,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2019-09-08 07:08:42,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:08:42,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:08:42,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:08:42,938 INFO L87 Difference]: Start difference. First operand 7114 states and 8584 transitions. Second operand 4 states. [2019-09-08 07:08:43,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:43,252 INFO L93 Difference]: Finished difference Result 14151 states and 17086 transitions. [2019-09-08 07:08:43,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:08:43,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 395 [2019-09-08 07:08:43,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:43,277 INFO L225 Difference]: With dead ends: 14151 [2019-09-08 07:08:43,277 INFO L226 Difference]: Without dead ends: 7050 [2019-09-08 07:08:43,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:08:43,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2019-09-08 07:08:43,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 7050. [2019-09-08 07:08:43,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7050 states. [2019-09-08 07:08:43,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7050 states to 7050 states and 8300 transitions. [2019-09-08 07:08:43,875 INFO L78 Accepts]: Start accepts. Automaton has 7050 states and 8300 transitions. Word has length 395 [2019-09-08 07:08:43,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:43,876 INFO L475 AbstractCegarLoop]: Abstraction has 7050 states and 8300 transitions. [2019-09-08 07:08:43,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:08:43,876 INFO L276 IsEmpty]: Start isEmpty. Operand 7050 states and 8300 transitions. [2019-09-08 07:08:43,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-09-08 07:08:43,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:43,892 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 07:08:43,892 INFO L418 AbstractCegarLoop]: === Iteration 36 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:43,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:43,893 INFO L82 PathProgramCache]: Analyzing trace with hash 453276901, now seen corresponding path program 1 times [2019-09-08 07:08:43,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:43,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:43,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:43,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:43,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:44,065 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2019-09-08 07:08:44,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:08:44,065 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:08:44,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:08:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:44,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 1912 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 07:08:44,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:08:44,474 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2019-09-08 07:08:44,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:08:44,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-09-08 07:08:44,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:08:44,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:08:44,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:08:44,482 INFO L87 Difference]: Start difference. First operand 7050 states and 8300 transitions. Second operand 4 states. [2019-09-08 07:08:45,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:45,106 INFO L93 Difference]: Finished difference Result 19981 states and 23587 transitions. [2019-09-08 07:08:45,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:08:45,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 395 [2019-09-08 07:08:45,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:45,666 INFO L225 Difference]: With dead ends: 19981 [2019-09-08 07:08:45,667 INFO L226 Difference]: Without dead ends: 13590 [2019-09-08 07:08:45,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 394 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:08:45,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13590 states. [2019-09-08 07:08:46,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13590 to 8617. [2019-09-08 07:08:46,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8617 states. [2019-09-08 07:08:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8617 states to 8617 states and 10124 transitions. [2019-09-08 07:08:46,394 INFO L78 Accepts]: Start accepts. Automaton has 8617 states and 10124 transitions. Word has length 395 [2019-09-08 07:08:46,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:46,395 INFO L475 AbstractCegarLoop]: Abstraction has 8617 states and 10124 transitions. [2019-09-08 07:08:46,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:08:46,396 INFO L276 IsEmpty]: Start isEmpty. Operand 8617 states and 10124 transitions. [2019-09-08 07:08:46,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-09-08 07:08:46,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:46,414 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 07:08:46,414 INFO L418 AbstractCegarLoop]: === Iteration 37 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:46,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:46,415 INFO L82 PathProgramCache]: Analyzing trace with hash 522924775, now seen corresponding path program 1 times [2019-09-08 07:08:46,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:46,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:46,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:46,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:46,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:46,587 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 878 trivial. 0 not checked. [2019-09-08 07:08:46,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:08:46,587 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:08:46,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:08:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:46,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 1911 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-08 07:08:46,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:08:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 194 proven. 122 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2019-09-08 07:08:47,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:08:47,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 13] total 14 [2019-09-08 07:08:47,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 07:08:47,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 07:08:47,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-08 07:08:47,356 INFO L87 Difference]: Start difference. First operand 8617 states and 10124 transitions. Second operand 14 states. [2019-09-08 07:08:52,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:52,417 INFO L93 Difference]: Finished difference Result 15452 states and 18243 transitions. [2019-09-08 07:08:52,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 07:08:52,418 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 395 [2019-09-08 07:08:52,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:52,443 INFO L225 Difference]: With dead ends: 15452 [2019-09-08 07:08:52,443 INFO L226 Difference]: Without dead ends: 7434 [2019-09-08 07:08:52,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 395 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=384, Invalid=1778, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 07:08:52,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7434 states. [2019-09-08 07:08:52,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7434 to 6950. [2019-09-08 07:08:52,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6950 states. [2019-09-08 07:08:52,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6950 states to 6950 states and 8155 transitions. [2019-09-08 07:08:52,852 INFO L78 Accepts]: Start accepts. Automaton has 6950 states and 8155 transitions. Word has length 395 [2019-09-08 07:08:52,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:52,853 INFO L475 AbstractCegarLoop]: Abstraction has 6950 states and 8155 transitions. [2019-09-08 07:08:52,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 07:08:52,853 INFO L276 IsEmpty]: Start isEmpty. Operand 6950 states and 8155 transitions. [2019-09-08 07:08:52,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-09-08 07:08:52,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:52,872 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:08:52,872 INFO L418 AbstractCegarLoop]: === Iteration 38 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:52,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:52,872 INFO L82 PathProgramCache]: Analyzing trace with hash 233675067, now seen corresponding path program 1 times [2019-09-08 07:08:52,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:52,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:52,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:52,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:52,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:53,345 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 31 proven. 229 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2019-09-08 07:08:53,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:08:53,345 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:08:53,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:53,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 1948 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 07:08:53,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:08:53,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 07:08:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 07:08:54,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:08:54,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2019-09-08 07:08:54,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 07:08:54,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 07:08:54,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-09-08 07:08:54,052 INFO L87 Difference]: Start difference. First operand 6950 states and 8155 transitions. Second operand 21 states. [2019-09-08 07:08:59,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:59,101 INFO L93 Difference]: Finished difference Result 14663 states and 17185 transitions. [2019-09-08 07:08:59,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 07:08:59,102 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 405 [2019-09-08 07:08:59,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:59,126 INFO L225 Difference]: With dead ends: 14663 [2019-09-08 07:08:59,126 INFO L226 Difference]: Without dead ends: 8191 [2019-09-08 07:08:59,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 427 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=446, Invalid=2860, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 07:08:59,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8191 states. [2019-09-08 07:08:59,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8191 to 7047. [2019-09-08 07:08:59,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7047 states. [2019-09-08 07:08:59,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7047 states to 7047 states and 8243 transitions. [2019-09-08 07:08:59,673 INFO L78 Accepts]: Start accepts. Automaton has 7047 states and 8243 transitions. Word has length 405 [2019-09-08 07:08:59,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:59,673 INFO L475 AbstractCegarLoop]: Abstraction has 7047 states and 8243 transitions. [2019-09-08 07:08:59,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 07:08:59,673 INFO L276 IsEmpty]: Start isEmpty. Operand 7047 states and 8243 transitions. [2019-09-08 07:08:59,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-09-08 07:08:59,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:59,689 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:08:59,689 INFO L418 AbstractCegarLoop]: === Iteration 39 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:59,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:59,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1284003182, now seen corresponding path program 1 times [2019-09-08 07:08:59,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:59,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:59,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:59,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:59,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:00,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 1004 trivial. 0 not checked. [2019-09-08 07:09:00,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:09:00,032 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:09:00,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:09:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:00,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 1976 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-08 07:09:00,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:09:01,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 485 proven. 183 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2019-09-08 07:09:01,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:09:01,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 25] total 37 [2019-09-08 07:09:01,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 07:09:01,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 07:09:01,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1240, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 07:09:01,481 INFO L87 Difference]: Start difference. First operand 7047 states and 8243 transitions. Second operand 37 states. [2019-09-08 07:09:16,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:09:16,148 INFO L93 Difference]: Finished difference Result 15477 states and 18184 transitions. [2019-09-08 07:09:16,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-08 07:09:16,150 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 416 [2019-09-08 07:09:16,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:09:16,179 INFO L225 Difference]: With dead ends: 15477 [2019-09-08 07:09:16,180 INFO L226 Difference]: Without dead ends: 9064 [2019-09-08 07:09:16,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 426 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5362 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1656, Invalid=14856, Unknown=0, NotChecked=0, Total=16512 [2019-09-08 07:09:16,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9064 states. [2019-09-08 07:09:16,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9064 to 7053. [2019-09-08 07:09:16,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7053 states. [2019-09-08 07:09:16,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7053 states to 7053 states and 8244 transitions. [2019-09-08 07:09:16,632 INFO L78 Accepts]: Start accepts. Automaton has 7053 states and 8244 transitions. Word has length 416 [2019-09-08 07:09:16,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:09:16,632 INFO L475 AbstractCegarLoop]: Abstraction has 7053 states and 8244 transitions. [2019-09-08 07:09:16,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 07:09:16,632 INFO L276 IsEmpty]: Start isEmpty. Operand 7053 states and 8244 transitions. [2019-09-08 07:09:16,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2019-09-08 07:09:16,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:09:16,643 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:09:16,643 INFO L418 AbstractCegarLoop]: === Iteration 40 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:09:16,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:09:16,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1931480896, now seen corresponding path program 1 times [2019-09-08 07:09:16,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:09:16,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:09:16,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:16,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:09:16,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1094 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-09-08 07:09:16,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:09:16,814 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:09:16,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:09:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:17,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 2002 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 07:09:17,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:09:17,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1094 backedges. 363 proven. 48 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 07:09:17,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:09:17,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 10] total 11 [2019-09-08 07:09:17,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:09:17,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:09:17,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:09:17,384 INFO L87 Difference]: Start difference. First operand 7053 states and 8244 transitions. Second operand 11 states. [2019-09-08 07:09:18,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:09:18,944 INFO L93 Difference]: Finished difference Result 13463 states and 15771 transitions. [2019-09-08 07:09:18,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 07:09:18,945 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 428 [2019-09-08 07:09:18,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:09:18,965 INFO L225 Difference]: With dead ends: 13463 [2019-09-08 07:09:18,965 INFO L226 Difference]: Without dead ends: 7045 [2019-09-08 07:09:18,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2019-09-08 07:09:18,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7045 states. [2019-09-08 07:09:19,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7045 to 7045. [2019-09-08 07:09:19,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7045 states. [2019-09-08 07:09:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7045 states to 7045 states and 8228 transitions. [2019-09-08 07:09:19,527 INFO L78 Accepts]: Start accepts. Automaton has 7045 states and 8228 transitions. Word has length 428 [2019-09-08 07:09:19,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:09:19,528 INFO L475 AbstractCegarLoop]: Abstraction has 7045 states and 8228 transitions. [2019-09-08 07:09:19,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:09:19,528 INFO L276 IsEmpty]: Start isEmpty. Operand 7045 states and 8228 transitions. [2019-09-08 07:09:19,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2019-09-08 07:09:19,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:09:19,538 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:09:19,539 INFO L418 AbstractCegarLoop]: === Iteration 41 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:09:19,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:09:19,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1933315262, now seen corresponding path program 1 times [2019-09-08 07:09:19,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:09:19,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:09:19,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:19,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:09:19,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:19,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1094 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2019-09-08 07:09:19,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:09:19,869 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:09:19,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:09:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:20,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 2003 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-08 07:09:20,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:09:21,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1094 backedges. 569 proven. 217 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-09-08 07:09:21,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:09:21,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 24] total 36 [2019-09-08 07:09:21,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 07:09:21,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 07:09:21,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1170, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 07:09:21,275 INFO L87 Difference]: Start difference. First operand 7045 states and 8228 transitions. Second operand 36 states. [2019-09-08 07:09:36,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:09:36,712 INFO L93 Difference]: Finished difference Result 12774 states and 14972 transitions. [2019-09-08 07:09:36,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-08 07:09:36,713 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 428 [2019-09-08 07:09:36,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:09:36,726 INFO L225 Difference]: With dead ends: 12774 [2019-09-08 07:09:36,726 INFO L226 Difference]: Without dead ends: 6323 [2019-09-08 07:09:36,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 438 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5347 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1600, Invalid=14656, Unknown=0, NotChecked=0, Total=16256 [2019-09-08 07:09:36,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6323 states. [2019-09-08 07:09:37,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6323 to 4615. [2019-09-08 07:09:37,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4615 states. [2019-09-08 07:09:37,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4615 states to 4615 states and 5368 transitions. [2019-09-08 07:09:37,012 INFO L78 Accepts]: Start accepts. Automaton has 4615 states and 5368 transitions. Word has length 428 [2019-09-08 07:09:37,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:09:37,012 INFO L475 AbstractCegarLoop]: Abstraction has 4615 states and 5368 transitions. [2019-09-08 07:09:37,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 07:09:37,012 INFO L276 IsEmpty]: Start isEmpty. Operand 4615 states and 5368 transitions. [2019-09-08 07:09:37,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2019-09-08 07:09:37,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:09:37,018 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:09:37,018 INFO L418 AbstractCegarLoop]: === Iteration 42 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:09:37,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:09:37,019 INFO L82 PathProgramCache]: Analyzing trace with hash 77496019, now seen corresponding path program 1 times [2019-09-08 07:09:37,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:09:37,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:09:37,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:37,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:09:37,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:37,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 1182 trivial. 0 not checked. [2019-09-08 07:09:37,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:09:37,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:09:37,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:09:37,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:09:37,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:09:37,255 INFO L87 Difference]: Start difference. First operand 4615 states and 5368 transitions. Second operand 10 states. [2019-09-08 07:09:38,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:09:38,410 INFO L93 Difference]: Finished difference Result 10888 states and 12976 transitions. [2019-09-08 07:09:38,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 07:09:38,410 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 452 [2019-09-08 07:09:38,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:09:38,424 INFO L225 Difference]: With dead ends: 10888 [2019-09-08 07:09:38,425 INFO L226 Difference]: Without dead ends: 6877 [2019-09-08 07:09:38,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-09-08 07:09:38,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6877 states. [2019-09-08 07:09:38,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6877 to 5683. [2019-09-08 07:09:38,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5683 states. [2019-09-08 07:09:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5683 states to 5683 states and 6673 transitions. [2019-09-08 07:09:38,750 INFO L78 Accepts]: Start accepts. Automaton has 5683 states and 6673 transitions. Word has length 452 [2019-09-08 07:09:38,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:09:38,751 INFO L475 AbstractCegarLoop]: Abstraction has 5683 states and 6673 transitions. [2019-09-08 07:09:38,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:09:38,751 INFO L276 IsEmpty]: Start isEmpty. Operand 5683 states and 6673 transitions. [2019-09-08 07:09:38,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-09-08 07:09:38,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:09:38,758 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:09:38,758 INFO L418 AbstractCegarLoop]: === Iteration 43 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:09:38,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:09:38,758 INFO L82 PathProgramCache]: Analyzing trace with hash -724643135, now seen corresponding path program 1 times [2019-09-08 07:09:38,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:09:38,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:09:38,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:38,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:09:38,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:39,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2019-09-08 07:09:39,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:09:39,377 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:09:39,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:09:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:39,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-08 07:09:39,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:09:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 298 proven. 333 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2019-09-08 07:09:41,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:09:41,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 49 [2019-09-08 07:09:41,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-08 07:09:41,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-08 07:09:41,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2177, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 07:09:41,218 INFO L87 Difference]: Start difference. First operand 5683 states and 6673 transitions. Second operand 49 states. [2019-09-08 07:10:18,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:10:18,624 INFO L93 Difference]: Finished difference Result 20273 states and 24084 transitions. [2019-09-08 07:10:18,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2019-09-08 07:10:18,625 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 453 [2019-09-08 07:10:18,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:10:18,656 INFO L225 Difference]: With dead ends: 20273 [2019-09-08 07:10:18,657 INFO L226 Difference]: Without dead ends: 15194 [2019-09-08 07:10:18,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 484 SyntacticMatches, 1 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15120 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=4008, Invalid=41148, Unknown=0, NotChecked=0, Total=45156 [2019-09-08 07:10:18,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15194 states. [2019-09-08 07:10:19,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15194 to 8059. [2019-09-08 07:10:19,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8059 states. [2019-09-08 07:10:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8059 states to 8059 states and 9528 transitions. [2019-09-08 07:10:19,249 INFO L78 Accepts]: Start accepts. Automaton has 8059 states and 9528 transitions. Word has length 453 [2019-09-08 07:10:19,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:10:19,249 INFO L475 AbstractCegarLoop]: Abstraction has 8059 states and 9528 transitions. [2019-09-08 07:10:19,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-08 07:10:19,250 INFO L276 IsEmpty]: Start isEmpty. Operand 8059 states and 9528 transitions. [2019-09-08 07:10:19,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-09-08 07:10:19,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:10:19,260 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:10:19,260 INFO L418 AbstractCegarLoop]: === Iteration 44 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:10:19,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:10:19,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1128866371, now seen corresponding path program 1 times [2019-09-08 07:10:19,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:10:19,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:10:19,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:10:19,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:10:19,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:10:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:10:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 16 proven. 34 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2019-09-08 07:10:20,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:10:20,074 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:10:20,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:10:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:10:20,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 2086 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 07:10:20,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:10:20,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 07:10:20,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 408 proven. 4 refuted. 0 times theorem prover too weak. 793 trivial. 0 not checked. [2019-09-08 07:10:20,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:10:20,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 7] total 33 [2019-09-08 07:10:20,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 07:10:20,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 07:10:20,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 07:10:20,736 INFO L87 Difference]: Start difference. First operand 8059 states and 9528 transitions. Second operand 33 states. [2019-09-08 07:10:32,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:10:32,074 INFO L93 Difference]: Finished difference Result 19567 states and 23262 transitions. [2019-09-08 07:10:32,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-08 07:10:32,075 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 453 [2019-09-08 07:10:32,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:10:32,106 INFO L225 Difference]: With dead ends: 19567 [2019-09-08 07:10:32,107 INFO L226 Difference]: Without dead ends: 12328 [2019-09-08 07:10:32,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 468 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1715 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1061, Invalid=6595, Unknown=0, NotChecked=0, Total=7656 [2019-09-08 07:10:32,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12328 states. [2019-09-08 07:10:32,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12328 to 8083. [2019-09-08 07:10:32,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8083 states. [2019-09-08 07:10:32,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8083 states to 8083 states and 9545 transitions. [2019-09-08 07:10:32,851 INFO L78 Accepts]: Start accepts. Automaton has 8083 states and 9545 transitions. Word has length 453 [2019-09-08 07:10:32,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:10:32,852 INFO L475 AbstractCegarLoop]: Abstraction has 8083 states and 9545 transitions. [2019-09-08 07:10:32,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 07:10:32,852 INFO L276 IsEmpty]: Start isEmpty. Operand 8083 states and 9545 transitions. [2019-09-08 07:10:32,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2019-09-08 07:10:32,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:10:32,867 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:10:32,867 INFO L418 AbstractCegarLoop]: === Iteration 45 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:10:32,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:10:32,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1065995382, now seen corresponding path program 1 times [2019-09-08 07:10:32,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:10:32,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:10:32,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:10:32,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:10:32,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:10:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:10:33,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2019-09-08 07:10:33,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:10:33,424 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:10:33,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:10:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:10:33,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 2089 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 07:10:33,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:10:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 518 proven. 36 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-09-08 07:10:34,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:10:34,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 11] total 34 [2019-09-08 07:10:34,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 07:10:34,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 07:10:34,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1041, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 07:10:34,396 INFO L87 Difference]: Start difference. First operand 8083 states and 9545 transitions. Second operand 34 states. [2019-09-08 07:10:57,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:10:57,489 INFO L93 Difference]: Finished difference Result 25642 states and 30523 transitions. [2019-09-08 07:10:57,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-08 07:10:57,490 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 454 [2019-09-08 07:10:57,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:10:57,526 INFO L225 Difference]: With dead ends: 25642 [2019-09-08 07:10:57,526 INFO L226 Difference]: Without dead ends: 18736 [2019-09-08 07:10:57,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 476 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3686 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1517, Invalid=12289, Unknown=0, NotChecked=0, Total=13806 [2019-09-08 07:10:57,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18736 states. [2019-09-08 07:10:58,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18736 to 11551. [2019-09-08 07:10:58,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11551 states. [2019-09-08 07:10:58,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11551 states to 11551 states and 13675 transitions. [2019-09-08 07:10:58,432 INFO L78 Accepts]: Start accepts. Automaton has 11551 states and 13675 transitions. Word has length 454 [2019-09-08 07:10:58,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:10:58,432 INFO L475 AbstractCegarLoop]: Abstraction has 11551 states and 13675 transitions. [2019-09-08 07:10:58,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 07:10:58,433 INFO L276 IsEmpty]: Start isEmpty. Operand 11551 states and 13675 transitions. [2019-09-08 07:10:58,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2019-09-08 07:10:58,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:10:58,452 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:10:58,452 INFO L418 AbstractCegarLoop]: === Iteration 46 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:10:58,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:10:58,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1952797125, now seen corresponding path program 1 times [2019-09-08 07:10:58,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:10:58,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:10:58,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:10:58,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:10:58,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:10:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:10:59,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 26 proven. 30 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2019-09-08 07:10:59,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:10:59,022 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:10:59,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:10:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:10:59,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 2089 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 07:10:59,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:10:59,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 403 proven. 162 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2019-09-08 07:10:59,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:10:59,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 13] total 40 [2019-09-08 07:10:59,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-08 07:10:59,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-08 07:10:59,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1475, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 07:10:59,896 INFO L87 Difference]: Start difference. First operand 11551 states and 13675 transitions. Second operand 40 states. [2019-09-08 07:11:00,282 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2019-09-08 07:11:57,470 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-08 07:13:26,365 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-09-08 07:14:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:14:30,256 INFO L93 Difference]: Finished difference Result 146971 states and 180530 transitions. [2019-09-08 07:14:30,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1542 states. [2019-09-08 07:14:30,257 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 454 [2019-09-08 07:14:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:14:30,728 INFO L225 Difference]: With dead ends: 146971 [2019-09-08 07:14:30,728 INFO L226 Difference]: Without dead ends: 136281 [2019-09-08 07:14:30,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2437 GetRequests, 858 SyntacticMatches, 1 SemanticMatches, 1578 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1184065 ImplicationChecksByTransitivity, 98.3s TimeCoverageRelationStatistics Valid=80261, Invalid=2414559, Unknown=0, NotChecked=0, Total=2494820 [2019-09-08 07:14:30,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136281 states. [2019-09-08 07:14:39,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136281 to 36682. [2019-09-08 07:14:39,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36682 states. [2019-09-08 07:14:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36682 states to 36682 states and 43193 transitions. [2019-09-08 07:14:39,530 INFO L78 Accepts]: Start accepts. Automaton has 36682 states and 43193 transitions. Word has length 454 [2019-09-08 07:14:39,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:14:39,530 INFO L475 AbstractCegarLoop]: Abstraction has 36682 states and 43193 transitions. [2019-09-08 07:14:39,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-08 07:14:39,530 INFO L276 IsEmpty]: Start isEmpty. Operand 36682 states and 43193 transitions. [2019-09-08 07:14:39,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2019-09-08 07:14:39,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:14:39,606 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:14:39,606 INFO L418 AbstractCegarLoop]: === Iteration 47 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:14:39,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:14:39,607 INFO L82 PathProgramCache]: Analyzing trace with hash -83283226, now seen corresponding path program 1 times [2019-09-08 07:14:39,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:14:39,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:14:39,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:14:39,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:14:39,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:14:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:14:40,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2019-09-08 07:14:40,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:14:40,218 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:14:40,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:14:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:14:40,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 2090 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 07:14:40,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:14:41,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 518 proven. 36 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-09-08 07:14:41,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:14:41,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 11] total 34 [2019-09-08 07:14:41,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 07:14:41,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 07:14:41,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1041, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 07:14:41,651 INFO L87 Difference]: Start difference. First operand 36682 states and 43193 transitions. Second operand 34 states. [2019-09-08 07:15:11,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:15:11,744 INFO L93 Difference]: Finished difference Result 113250 states and 134466 transitions. [2019-09-08 07:15:11,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-08 07:15:11,745 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 455 [2019-09-08 07:15:11,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:15:11,945 INFO L225 Difference]: With dead ends: 113250 [2019-09-08 07:15:11,945 INFO L226 Difference]: Without dead ends: 77767 [2019-09-08 07:15:12,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 477 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3685 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1517, Invalid=12289, Unknown=0, NotChecked=0, Total=13806 [2019-09-08 07:15:12,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77767 states. [2019-09-08 07:15:16,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77767 to 36660. [2019-09-08 07:15:16,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36660 states. [2019-09-08 07:15:16,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36660 states to 36660 states and 43171 transitions. [2019-09-08 07:15:16,082 INFO L78 Accepts]: Start accepts. Automaton has 36660 states and 43171 transitions. Word has length 455 [2019-09-08 07:15:16,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:15:16,083 INFO L475 AbstractCegarLoop]: Abstraction has 36660 states and 43171 transitions. [2019-09-08 07:15:16,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 07:15:16,083 INFO L276 IsEmpty]: Start isEmpty. Operand 36660 states and 43171 transitions. [2019-09-08 07:15:16,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2019-09-08 07:15:16,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:15:16,124 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:15:16,124 INFO L418 AbstractCegarLoop]: === Iteration 48 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:15:16,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:15:16,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1272075800, now seen corresponding path program 1 times [2019-09-08 07:15:16,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:15:16,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:15:16,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:16,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:15:16,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:15:16,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1198 trivial. 0 not checked. [2019-09-08 07:15:16,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:15:16,576 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:15:16,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:15:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:15:16,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 2089 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 07:15:16,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:15:17,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 427 proven. 52 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2019-09-08 07:15:17,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:15:17,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 12] total 13 [2019-09-08 07:15:17,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:15:17,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:15:17,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:15:17,164 INFO L87 Difference]: Start difference. First operand 36660 states and 43171 transitions. Second operand 13 states. [2019-09-08 07:15:22,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:15:22,097 INFO L93 Difference]: Finished difference Result 60577 states and 71451 transitions. [2019-09-08 07:15:22,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 07:15:22,098 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 455 [2019-09-08 07:15:22,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:15:22,163 INFO L225 Difference]: With dead ends: 60577 [2019-09-08 07:15:22,163 INFO L226 Difference]: Without dead ends: 24654 [2019-09-08 07:15:22,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2019-09-08 07:15:22,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24654 states. [2019-09-08 07:15:24,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24654 to 24354. [2019-09-08 07:15:24,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24354 states. [2019-09-08 07:15:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24354 states to 24354 states and 28676 transitions. [2019-09-08 07:15:24,615 INFO L78 Accepts]: Start accepts. Automaton has 24354 states and 28676 transitions. Word has length 455 [2019-09-08 07:15:24,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:15:24,616 INFO L475 AbstractCegarLoop]: Abstraction has 24354 states and 28676 transitions. [2019-09-08 07:15:24,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:15:24,616 INFO L276 IsEmpty]: Start isEmpty. Operand 24354 states and 28676 transitions. [2019-09-08 07:15:24,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2019-09-08 07:15:24,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:15:24,639 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:15:24,639 INFO L418 AbstractCegarLoop]: === Iteration 49 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:15:24,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:15:24,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1672005156, now seen corresponding path program 1 times [2019-09-08 07:15:24,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:15:24,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:15:24,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:24,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:15:24,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:15:24,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1213 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 1181 trivial. 0 not checked. [2019-09-08 07:15:24,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:15:24,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:15:24,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:15:24,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:15:24,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:15:24,860 INFO L87 Difference]: Start difference. First operand 24354 states and 28676 transitions. Second operand 11 states. [2019-09-08 07:15:29,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:15:29,706 INFO L93 Difference]: Finished difference Result 53847 states and 64976 transitions. [2019-09-08 07:15:29,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 07:15:29,707 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 454 [2019-09-08 07:15:29,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:15:29,802 INFO L225 Difference]: With dead ends: 53847 [2019-09-08 07:15:29,803 INFO L226 Difference]: Without dead ends: 30328 [2019-09-08 07:15:29,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 07:15:29,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30328 states. [2019-09-08 07:15:31,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30328 to 13436. [2019-09-08 07:15:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13436 states. [2019-09-08 07:15:31,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13436 states to 13436 states and 15585 transitions. [2019-09-08 07:15:31,779 INFO L78 Accepts]: Start accepts. Automaton has 13436 states and 15585 transitions. Word has length 454 [2019-09-08 07:15:31,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:15:31,780 INFO L475 AbstractCegarLoop]: Abstraction has 13436 states and 15585 transitions. [2019-09-08 07:15:31,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:15:31,780 INFO L276 IsEmpty]: Start isEmpty. Operand 13436 states and 15585 transitions. [2019-09-08 07:15:31,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2019-09-08 07:15:31,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:15:31,796 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:15:31,796 INFO L418 AbstractCegarLoop]: === Iteration 50 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:15:31,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:15:31,796 INFO L82 PathProgramCache]: Analyzing trace with hash -770998536, now seen corresponding path program 1 times [2019-09-08 07:15:31,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:15:31,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:15:31,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:31,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:15:31,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:15:32,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 40 proven. 4 refuted. 0 times theorem prover too weak. 1241 trivial. 0 not checked. [2019-09-08 07:15:32,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:15:32,140 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:15:32,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:15:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:15:32,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 2120 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 07:15:32,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:15:32,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 939 trivial. 0 not checked. [2019-09-08 07:15:32,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:15:32,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 13 [2019-09-08 07:15:32,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:15:32,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:15:32,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:15:32,573 INFO L87 Difference]: Start difference. First operand 13436 states and 15585 transitions. Second operand 13 states. [2019-09-08 07:15:36,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:15:36,420 INFO L93 Difference]: Finished difference Result 32090 states and 37614 transitions. [2019-09-08 07:15:36,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 07:15:36,421 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 463 [2019-09-08 07:15:36,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:15:36,473 INFO L225 Difference]: With dead ends: 32090 [2019-09-08 07:15:36,473 INFO L226 Difference]: Without dead ends: 19489 [2019-09-08 07:15:36,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-08 07:15:36,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19489 states. [2019-09-08 07:15:38,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19489 to 12554. [2019-09-08 07:15:38,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12554 states. [2019-09-08 07:15:38,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12554 states to 12554 states and 14381 transitions. [2019-09-08 07:15:38,131 INFO L78 Accepts]: Start accepts. Automaton has 12554 states and 14381 transitions. Word has length 463 [2019-09-08 07:15:38,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:15:38,132 INFO L475 AbstractCegarLoop]: Abstraction has 12554 states and 14381 transitions. [2019-09-08 07:15:38,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:15:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 12554 states and 14381 transitions. [2019-09-08 07:15:38,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2019-09-08 07:15:38,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:15:38,147 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:15:38,147 INFO L418 AbstractCegarLoop]: === Iteration 51 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:15:38,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:15:38,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1885717923, now seen corresponding path program 1 times [2019-09-08 07:15:38,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:15:38,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:15:38,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:38,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:15:38,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:15:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1284 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2019-09-08 07:15:38,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:15:38,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:15:38,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:15:38,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:15:38,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:15:38,363 INFO L87 Difference]: Start difference. First operand 12554 states and 14381 transitions. Second operand 11 states. [2019-09-08 07:15:43,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:15:43,719 INFO L93 Difference]: Finished difference Result 40103 states and 47934 transitions. [2019-09-08 07:15:43,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 07:15:43,719 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 465 [2019-09-08 07:15:43,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:15:43,784 INFO L225 Difference]: With dead ends: 40103 [2019-09-08 07:15:43,784 INFO L226 Difference]: Without dead ends: 28160 [2019-09-08 07:15:43,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=862, Unknown=0, NotChecked=0, Total=992 [2019-09-08 07:15:43,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28160 states. [2019-09-08 07:15:45,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28160 to 15316. [2019-09-08 07:15:45,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15316 states. [2019-09-08 07:15:45,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15316 states to 15316 states and 17468 transitions. [2019-09-08 07:15:45,971 INFO L78 Accepts]: Start accepts. Automaton has 15316 states and 17468 transitions. Word has length 465 [2019-09-08 07:15:45,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:15:45,972 INFO L475 AbstractCegarLoop]: Abstraction has 15316 states and 17468 transitions. [2019-09-08 07:15:45,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:15:45,972 INFO L276 IsEmpty]: Start isEmpty. Operand 15316 states and 17468 transitions. [2019-09-08 07:15:45,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2019-09-08 07:15:45,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:15:45,992 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:15:45,993 INFO L418 AbstractCegarLoop]: === Iteration 52 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:15:45,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:15:45,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1476646575, now seen corresponding path program 1 times [2019-09-08 07:15:45,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:15:45,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:15:45,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:45,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:15:45,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:15:46,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 58 proven. 72 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2019-09-08 07:15:46,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:15:46,330 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:15:46,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:15:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:15:46,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 2123 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-08 07:15:46,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:15:46,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 532 proven. 98 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-09-08 07:15:46,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:15:46,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 18 [2019-09-08 07:15:46,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 07:15:46,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 07:15:46,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-08 07:15:46,905 INFO L87 Difference]: Start difference. First operand 15316 states and 17468 transitions. Second operand 18 states. [2019-09-08 07:15:53,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:15:53,926 INFO L93 Difference]: Finished difference Result 25248 states and 28946 transitions. [2019-09-08 07:15:53,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 07:15:53,926 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 465 [2019-09-08 07:15:53,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:15:53,953 INFO L225 Difference]: With dead ends: 25248 [2019-09-08 07:15:53,954 INFO L226 Difference]: Without dead ends: 10767 [2019-09-08 07:15:53,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 491 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=515, Invalid=3267, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 07:15:53,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10767 states. [2019-09-08 07:15:55,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10767 to 9252. [2019-09-08 07:15:55,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9252 states. [2019-09-08 07:15:55,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9252 states to 9252 states and 10495 transitions. [2019-09-08 07:15:55,359 INFO L78 Accepts]: Start accepts. Automaton has 9252 states and 10495 transitions. Word has length 465 [2019-09-08 07:15:55,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:15:55,360 INFO L475 AbstractCegarLoop]: Abstraction has 9252 states and 10495 transitions. [2019-09-08 07:15:55,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 07:15:55,360 INFO L276 IsEmpty]: Start isEmpty. Operand 9252 states and 10495 transitions. [2019-09-08 07:15:55,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2019-09-08 07:15:55,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:15:55,373 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:15:55,373 INFO L418 AbstractCegarLoop]: === Iteration 53 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:15:55,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:15:55,373 INFO L82 PathProgramCache]: Analyzing trace with hash -152800274, now seen corresponding path program 1 times [2019-09-08 07:15:55,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:15:55,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:15:55,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:55,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:15:55,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:15:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:15:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 15 proven. 35 refuted. 0 times theorem prover too weak. 1233 trivial. 0 not checked. [2019-09-08 07:15:56,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:15:56,356 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:15:56,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:15:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:15:56,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 2112 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 07:15:56,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:15:56,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 07:15:56,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 470 proven. 9 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2019-09-08 07:15:56,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:15:56,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 7] total 33 [2019-09-08 07:15:56,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 07:15:56,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 07:15:56,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 07:15:56,982 INFO L87 Difference]: Start difference. First operand 9252 states and 10495 transitions. Second operand 33 states. [2019-09-08 07:16:08,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:16:08,053 INFO L93 Difference]: Finished difference Result 22709 states and 26629 transitions. [2019-09-08 07:16:08,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-08 07:16:08,054 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 465 [2019-09-08 07:16:08,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:16:08,086 INFO L225 Difference]: With dead ends: 22709 [2019-09-08 07:16:08,086 INFO L226 Difference]: Without dead ends: 13873 [2019-09-08 07:16:08,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 478 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1715 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1061, Invalid=6595, Unknown=0, NotChecked=0, Total=7656 [2019-09-08 07:16:08,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13873 states. [2019-09-08 07:16:09,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13873 to 9414. [2019-09-08 07:16:09,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9414 states. [2019-09-08 07:16:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9414 states to 9414 states and 10625 transitions. [2019-09-08 07:16:09,539 INFO L78 Accepts]: Start accepts. Automaton has 9414 states and 10625 transitions. Word has length 465 [2019-09-08 07:16:09,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:16:09,539 INFO L475 AbstractCegarLoop]: Abstraction has 9414 states and 10625 transitions. [2019-09-08 07:16:09,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 07:16:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 9414 states and 10625 transitions. [2019-09-08 07:16:09,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2019-09-08 07:16:09,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:16:09,551 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:16:09,551 INFO L418 AbstractCegarLoop]: === Iteration 54 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:16:09,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:16:09,551 INFO L82 PathProgramCache]: Analyzing trace with hash 670126216, now seen corresponding path program 1 times [2019-09-08 07:16:09,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:16:09,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:16:09,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:09,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:16:09,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:16:10,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 26 proven. 30 refuted. 0 times theorem prover too weak. 1227 trivial. 0 not checked. [2019-09-08 07:16:10,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:16:10,152 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:16:10,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:16:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:16:10,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 2115 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 07:16:10,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:16:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 537 proven. 89 refuted. 0 times theorem prover too weak. 657 trivial. 0 not checked. [2019-09-08 07:16:11,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:16:11,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 17] total 43 [2019-09-08 07:16:11,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-08 07:16:11,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-08 07:16:11,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1682, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 07:16:11,305 INFO L87 Difference]: Start difference. First operand 9414 states and 10625 transitions. Second operand 43 states. [2019-09-08 07:17:15,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:17:15,067 INFO L93 Difference]: Finished difference Result 66538 states and 82168 transitions. [2019-09-08 07:17:15,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 309 states. [2019-09-08 07:17:15,067 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 466 [2019-09-08 07:17:15,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:17:15,221 INFO L225 Difference]: With dead ends: 66538 [2019-09-08 07:17:15,222 INFO L226 Difference]: Without dead ends: 57967 [2019-09-08 07:17:15,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 860 GetRequests, 514 SyntacticMatches, 2 SemanticMatches, 344 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47831 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=8091, Invalid=111279, Unknown=0, NotChecked=0, Total=119370 [2019-09-08 07:17:15,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57967 states. [2019-09-08 07:17:18,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57967 to 15876. [2019-09-08 07:17:18,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15876 states. [2019-09-08 07:17:18,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15876 states to 15876 states and 18194 transitions. [2019-09-08 07:17:18,498 INFO L78 Accepts]: Start accepts. Automaton has 15876 states and 18194 transitions. Word has length 466 [2019-09-08 07:17:18,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:17:18,499 INFO L475 AbstractCegarLoop]: Abstraction has 15876 states and 18194 transitions. [2019-09-08 07:17:18,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-08 07:17:18,499 INFO L276 IsEmpty]: Start isEmpty. Operand 15876 states and 18194 transitions. [2019-09-08 07:17:18,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-09-08 07:17:18,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:17:18,514 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:17:18,515 INFO L418 AbstractCegarLoop]: === Iteration 55 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:17:18,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:17:18,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1640924721, now seen corresponding path program 1 times [2019-09-08 07:17:18,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:17:18,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:17:18,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:17:18,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:17:18,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:17:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:17:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 26 proven. 30 refuted. 0 times theorem prover too weak. 1227 trivial. 0 not checked. [2019-09-08 07:17:19,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:17:19,081 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:17:19,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:17:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:17:19,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 2116 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-08 07:17:19,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:17:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 537 proven. 89 refuted. 0 times theorem prover too weak. 657 trivial. 0 not checked. [2019-09-08 07:17:20,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:17:20,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 17] total 44 [2019-09-08 07:17:20,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-08 07:17:20,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-08 07:17:20,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1751, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 07:17:20,149 INFO L87 Difference]: Start difference. First operand 15876 states and 18194 transitions. Second operand 44 states. [2019-09-08 07:18:33,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:18:33,243 INFO L93 Difference]: Finished difference Result 96524 states and 120908 transitions. [2019-09-08 07:18:33,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 309 states. [2019-09-08 07:18:33,243 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 467 [2019-09-08 07:18:33,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:18:33,437 INFO L225 Difference]: With dead ends: 96524 [2019-09-08 07:18:33,437 INFO L226 Difference]: Without dead ends: 81599 [2019-09-08 07:18:33,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 861 GetRequests, 512 SyntacticMatches, 4 SemanticMatches, 345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48555 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=8401, Invalid=111661, Unknown=0, NotChecked=0, Total=120062 [2019-09-08 07:18:33,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81599 states. [2019-09-08 07:18:38,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81599 to 22298. [2019-09-08 07:18:38,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22298 states. [2019-09-08 07:18:38,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22298 states to 22298 states and 25780 transitions. [2019-09-08 07:18:38,190 INFO L78 Accepts]: Start accepts. Automaton has 22298 states and 25780 transitions. Word has length 467 [2019-09-08 07:18:38,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:18:38,191 INFO L475 AbstractCegarLoop]: Abstraction has 22298 states and 25780 transitions. [2019-09-08 07:18:38,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-08 07:18:38,191 INFO L276 IsEmpty]: Start isEmpty. Operand 22298 states and 25780 transitions. [2019-09-08 07:18:38,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-09-08 07:18:38,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:18:38,211 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:18:38,212 INFO L418 AbstractCegarLoop]: === Iteration 56 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:18:38,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:18:38,212 INFO L82 PathProgramCache]: Analyzing trace with hash -800533069, now seen corresponding path program 1 times [2019-09-08 07:18:38,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:18:38,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:18:38,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:38,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:18:38,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:18:38,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-09-08 07:18:38,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:18:38,404 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:18:38,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:18:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:18:38,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 2115 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 07:18:38,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:18:39,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 489 proven. 56 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2019-09-08 07:18:39,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:18:39,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 12] total 13 [2019-09-08 07:18:39,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:18:39,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:18:39,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:18:39,114 INFO L87 Difference]: Start difference. First operand 22298 states and 25780 transitions. Second operand 13 states. [2019-09-08 07:18:44,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:18:44,106 INFO L93 Difference]: Finished difference Result 41182 states and 47756 transitions. [2019-09-08 07:18:44,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 07:18:44,106 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 467 [2019-09-08 07:18:44,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:18:44,154 INFO L225 Difference]: With dead ends: 41182 [2019-09-08 07:18:44,154 INFO L226 Difference]: Without dead ends: 19394 [2019-09-08 07:18:44,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2019-09-08 07:18:44,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19394 states. [2019-09-08 07:18:47,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19394 to 18461. [2019-09-08 07:18:47,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18461 states. [2019-09-08 07:18:47,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18461 states to 18461 states and 21212 transitions. [2019-09-08 07:18:47,442 INFO L78 Accepts]: Start accepts. Automaton has 18461 states and 21212 transitions. Word has length 467 [2019-09-08 07:18:47,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:18:47,442 INFO L475 AbstractCegarLoop]: Abstraction has 18461 states and 21212 transitions. [2019-09-08 07:18:47,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:18:47,442 INFO L276 IsEmpty]: Start isEmpty. Operand 18461 states and 21212 transitions. [2019-09-08 07:18:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2019-09-08 07:18:47,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:18:47,456 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:18:47,456 INFO L418 AbstractCegarLoop]: === Iteration 57 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:18:47,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:18:47,457 INFO L82 PathProgramCache]: Analyzing trace with hash 59091150, now seen corresponding path program 1 times [2019-09-08 07:18:47,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:18:47,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:18:47,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:47,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:18:47,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:18:47,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1284 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1272 trivial. 0 not checked. [2019-09-08 07:18:47,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:18:47,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:18:47,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:18:47,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:18:47,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:18:47,612 INFO L87 Difference]: Start difference. First operand 18461 states and 21212 transitions. Second operand 4 states. [2019-09-08 07:18:52,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:18:52,717 INFO L93 Difference]: Finished difference Result 45693 states and 54179 transitions. [2019-09-08 07:18:52,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:18:52,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 466 [2019-09-08 07:18:52,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:18:52,787 INFO L225 Difference]: With dead ends: 45693 [2019-09-08 07:18:52,787 INFO L226 Difference]: Without dead ends: 28175 [2019-09-08 07:18:52,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:18:52,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28175 states. [2019-09-08 07:18:56,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28175 to 17555. [2019-09-08 07:18:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17555 states. [2019-09-08 07:18:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17555 states to 17555 states and 19968 transitions. [2019-09-08 07:18:56,080 INFO L78 Accepts]: Start accepts. Automaton has 17555 states and 19968 transitions. Word has length 466 [2019-09-08 07:18:56,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:18:56,080 INFO L475 AbstractCegarLoop]: Abstraction has 17555 states and 19968 transitions. [2019-09-08 07:18:56,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:18:56,080 INFO L276 IsEmpty]: Start isEmpty. Operand 17555 states and 19968 transitions. [2019-09-08 07:18:56,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-09-08 07:18:56,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:18:56,096 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:18:56,096 INFO L418 AbstractCegarLoop]: === Iteration 58 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:18:56,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:18:56,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1535790799, now seen corresponding path program 1 times [2019-09-08 07:18:56,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:18:56,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:18:56,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:56,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:18:56,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:18:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2019-09-08 07:18:56,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:18:56,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:18:56,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:18:56,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:18:56,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:18:56,290 INFO L87 Difference]: Start difference. First operand 17555 states and 19968 transitions. Second operand 11 states. [2019-09-08 07:19:03,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:19:03,873 INFO L93 Difference]: Finished difference Result 51383 states and 61548 transitions. [2019-09-08 07:19:03,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 07:19:03,873 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 467 [2019-09-08 07:19:03,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:19:03,955 INFO L225 Difference]: With dead ends: 51383 [2019-09-08 07:19:03,955 INFO L226 Difference]: Without dead ends: 34771 [2019-09-08 07:19:03,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2019-09-08 07:19:04,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34771 states. [2019-09-08 07:19:07,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34771 to 17545. [2019-09-08 07:19:07,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17545 states. [2019-09-08 07:19:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17545 states to 17545 states and 19936 transitions. [2019-09-08 07:19:07,437 INFO L78 Accepts]: Start accepts. Automaton has 17545 states and 19936 transitions. Word has length 467 [2019-09-08 07:19:07,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:19:07,437 INFO L475 AbstractCegarLoop]: Abstraction has 17545 states and 19936 transitions. [2019-09-08 07:19:07,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:19:07,437 INFO L276 IsEmpty]: Start isEmpty. Operand 17545 states and 19936 transitions. [2019-09-08 07:19:07,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-09-08 07:19:07,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:19:07,453 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 07:19:07,453 INFO L418 AbstractCegarLoop]: === Iteration 59 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:19:07,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:19:07,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1793956237, now seen corresponding path program 1 times [2019-09-08 07:19:07,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:19:07,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:19:07,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:07,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:19:07,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:19:07,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1267 trivial. 0 not checked. [2019-09-08 07:19:07,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:19:07,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:19:07,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:19:07,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:19:07,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:19:07,734 INFO L87 Difference]: Start difference. First operand 17545 states and 19936 transitions. Second operand 4 states. [2019-09-08 07:19:10,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:19:10,776 INFO L93 Difference]: Finished difference Result 34413 states and 39267 transitions. [2019-09-08 07:19:10,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:19:10,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 467 [2019-09-08 07:19:10,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:19:10,810 INFO L225 Difference]: With dead ends: 34413 [2019-09-08 07:19:10,810 INFO L226 Difference]: Without dead ends: 17841 [2019-09-08 07:19:10,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:19:10,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17841 states. [2019-09-08 07:19:13,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17841 to 17537. [2019-09-08 07:19:13,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17537 states. [2019-09-08 07:19:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17537 states to 17537 states and 19896 transitions. [2019-09-08 07:19:13,851 INFO L78 Accepts]: Start accepts. Automaton has 17537 states and 19896 transitions. Word has length 467 [2019-09-08 07:19:13,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:19:13,851 INFO L475 AbstractCegarLoop]: Abstraction has 17537 states and 19896 transitions. [2019-09-08 07:19:13,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:19:13,851 INFO L276 IsEmpty]: Start isEmpty. Operand 17537 states and 19896 transitions. [2019-09-08 07:19:13,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-09-08 07:19:13,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:19:13,866 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 07:19:13,866 INFO L418 AbstractCegarLoop]: === Iteration 60 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:19:13,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:19:13,866 INFO L82 PathProgramCache]: Analyzing trace with hash 720861926, now seen corresponding path program 1 times [2019-09-08 07:19:13,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:19:13,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:19:13,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:13,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:19:13,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:19:14,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1284 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1272 trivial. 0 not checked. [2019-09-08 07:19:14,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:19:14,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:19:14,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:19:14,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:19:14,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:19:14,032 INFO L87 Difference]: Start difference. First operand 17537 states and 19896 transitions. Second operand 4 states. [2019-09-08 07:19:18,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:19:18,511 INFO L93 Difference]: Finished difference Result 41703 states and 48691 transitions. [2019-09-08 07:19:18,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:19:18,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 467 [2019-09-08 07:19:18,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:19:18,573 INFO L225 Difference]: With dead ends: 41703 [2019-09-08 07:19:18,574 INFO L226 Difference]: Without dead ends: 25139 [2019-09-08 07:19:18,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:19:18,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25139 states. [2019-09-08 07:19:21,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25139 to 18389. [2019-09-08 07:19:21,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18389 states. [2019-09-08 07:19:21,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18389 states to 18389 states and 20748 transitions. [2019-09-08 07:19:21,936 INFO L78 Accepts]: Start accepts. Automaton has 18389 states and 20748 transitions. Word has length 467 [2019-09-08 07:19:21,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:19:21,936 INFO L475 AbstractCegarLoop]: Abstraction has 18389 states and 20748 transitions. [2019-09-08 07:19:21,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:19:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 18389 states and 20748 transitions. [2019-09-08 07:19:21,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-09-08 07:19:21,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:19:21,956 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 07:19:21,956 INFO L418 AbstractCegarLoop]: === Iteration 61 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:19:21,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:19:21,957 INFO L82 PathProgramCache]: Analyzing trace with hash 698735590, now seen corresponding path program 1 times [2019-09-08 07:19:21,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:19:21,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:19:21,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:21,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:19:21,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:19:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1284 backedges. 85 proven. 52 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2019-09-08 07:19:22,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:19:22,288 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:19:22,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:19:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:19:22,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 2127 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 07:19:22,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:19:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1284 backedges. 544 proven. 98 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2019-09-08 07:19:22,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:19:22,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 18 [2019-09-08 07:19:22,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 07:19:22,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 07:19:22,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-08 07:19:22,834 INFO L87 Difference]: Start difference. First operand 18389 states and 20748 transitions. Second operand 18 states. [2019-09-08 07:19:32,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:19:32,131 INFO L93 Difference]: Finished difference Result 41791 states and 47312 transitions. [2019-09-08 07:19:32,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-08 07:19:32,132 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 467 [2019-09-08 07:19:32,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:19:32,185 INFO L225 Difference]: With dead ends: 41791 [2019-09-08 07:19:32,185 INFO L226 Difference]: Without dead ends: 24271 [2019-09-08 07:19:32,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 502 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=591, Invalid=3699, Unknown=0, NotChecked=0, Total=4290 [2019-09-08 07:19:32,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24271 states. [2019-09-08 07:19:37,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24271 to 21361. [2019-09-08 07:19:37,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21361 states. [2019-09-08 07:19:37,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21361 states to 21361 states and 23936 transitions. [2019-09-08 07:19:37,228 INFO L78 Accepts]: Start accepts. Automaton has 21361 states and 23936 transitions. Word has length 467 [2019-09-08 07:19:37,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:19:37,229 INFO L475 AbstractCegarLoop]: Abstraction has 21361 states and 23936 transitions. [2019-09-08 07:19:37,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 07:19:37,229 INFO L276 IsEmpty]: Start isEmpty. Operand 21361 states and 23936 transitions. [2019-09-08 07:19:37,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-09-08 07:19:37,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:19:37,247 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:19:37,247 INFO L418 AbstractCegarLoop]: === Iteration 62 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:19:37,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:19:37,247 INFO L82 PathProgramCache]: Analyzing trace with hash -602159892, now seen corresponding path program 1 times [2019-09-08 07:19:37,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:19:37,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:19:37,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:37,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:19:37,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:19:37,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 1244 trivial. 0 not checked. [2019-09-08 07:19:37,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:19:37,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:19:37,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:19:37,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:19:37,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:19:37,446 INFO L87 Difference]: Start difference. First operand 21361 states and 23936 transitions. Second operand 11 states. [2019-09-08 07:19:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:19:45,821 INFO L93 Difference]: Finished difference Result 58727 states and 69504 transitions. [2019-09-08 07:19:45,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 07:19:45,822 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 469 [2019-09-08 07:19:45,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:19:45,920 INFO L225 Difference]: With dead ends: 58727 [2019-09-08 07:19:45,920 INFO L226 Difference]: Without dead ends: 38339 [2019-09-08 07:19:45,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2019-09-08 07:19:45,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38339 states. [2019-09-08 07:19:49,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38339 to 21361. [2019-09-08 07:19:49,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21361 states. [2019-09-08 07:19:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21361 states to 21361 states and 23920 transitions. [2019-09-08 07:19:49,867 INFO L78 Accepts]: Start accepts. Automaton has 21361 states and 23920 transitions. Word has length 469 [2019-09-08 07:19:49,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:19:49,867 INFO L475 AbstractCegarLoop]: Abstraction has 21361 states and 23920 transitions. [2019-09-08 07:19:49,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:19:49,868 INFO L276 IsEmpty]: Start isEmpty. Operand 21361 states and 23920 transitions. [2019-09-08 07:19:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-09-08 07:19:49,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:19:49,888 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:19:49,888 INFO L418 AbstractCegarLoop]: === Iteration 63 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:19:49,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:19:49,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1677973780, now seen corresponding path program 1 times [2019-09-08 07:19:49,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:19:49,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:19:49,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:49,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:19:49,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:19:50,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 1241 trivial. 0 not checked. [2019-09-08 07:19:50,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:19:50,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:19:50,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:19:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:19:50,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 2141 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 07:19:50,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:19:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 934 trivial. 0 not checked. [2019-09-08 07:19:50,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:19:50,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 13 [2019-09-08 07:19:50,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:19:50,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:19:50,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:19:50,530 INFO L87 Difference]: Start difference. First operand 21361 states and 23920 transitions. Second operand 13 states. [2019-09-08 07:19:56,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:19:56,705 INFO L93 Difference]: Finished difference Result 50717 states and 58239 transitions. [2019-09-08 07:19:56,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 07:19:56,705 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 469 [2019-09-08 07:19:56,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:19:56,779 INFO L225 Difference]: With dead ends: 50717 [2019-09-08 07:19:56,779 INFO L226 Difference]: Without dead ends: 30329 [2019-09-08 07:19:56,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-08 07:19:56,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30329 states.