java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label01.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 19:15:27,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 19:15:27,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 19:15:27,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 19:15:27,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 19:15:27,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 19:15:27,653 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 19:15:27,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 19:15:27,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 19:15:27,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 19:15:27,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 19:15:27,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 19:15:27,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 19:15:27,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 19:15:27,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 19:15:27,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 19:15:27,663 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 19:15:27,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 19:15:27,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 19:15:27,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 19:15:27,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 19:15:27,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 19:15:27,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 19:15:27,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 19:15:27,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 19:15:27,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 19:15:27,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 19:15:27,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 19:15:27,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 19:15:27,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 19:15:27,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 19:15:27,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 19:15:27,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 19:15:27,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 19:15:27,682 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 19:15:27,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 19:15:27,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 19:15:27,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 19:15:27,684 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 19:15:27,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 19:15:27,685 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 19:15:27,689 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 19:15:27,715 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 19:15:27,715 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 19:15:27,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 19:15:27,717 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 19:15:27,717 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 19:15:27,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 19:15:27,718 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 19:15:27,718 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 19:15:27,718 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 19:15:27,718 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 19:15:27,719 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 19:15:27,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 19:15:27,720 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 19:15:27,720 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 19:15:27,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 19:15:27,721 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 19:15:27,721 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 19:15:27,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 19:15:27,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 19:15:27,722 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 19:15:27,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 19:15:27,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:15:27,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 19:15:27,723 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 19:15:27,723 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 19:15:27,723 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 19:15:27,724 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 19:15:27,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 19:15:27,724 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 19:15:27,778 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 19:15:27,795 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 19:15:27,799 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 19:15:27,800 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 19:15:27,801 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 19:15:27,801 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label01.c [2019-09-07 19:15:27,883 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4c6920ca/9e3279a4b0ad44c3bbfd5c60148a33de/FLAGb0e9851e9 [2019-09-07 19:15:28,741 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 19:15:28,744 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label01.c [2019-09-07 19:15:28,796 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4c6920ca/9e3279a4b0ad44c3bbfd5c60148a33de/FLAGb0e9851e9 [2019-09-07 19:15:29,204 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4c6920ca/9e3279a4b0ad44c3bbfd5c60148a33de [2019-09-07 19:15:29,215 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 19:15:29,217 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 19:15:29,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 19:15:29,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 19:15:29,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 19:15:29,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:15:29" (1/1) ... [2019-09-07 19:15:29,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5fe7e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:15:29, skipping insertion in model container [2019-09-07 19:15:29,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:15:29" (1/1) ... [2019-09-07 19:15:29,234 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 19:15:29,411 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 19:15:31,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:15:31,174 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 19:15:31,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:15:31,907 INFO L192 MainTranslator]: Completed translation [2019-09-07 19:15:31,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:15:31 WrapperNode [2019-09-07 19:15:31,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 19:15:31,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 19:15:31,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 19:15:31,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 19:15:31,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:15:31" (1/1) ... [2019-09-07 19:15:31,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:15:31" (1/1) ... [2019-09-07 19:15:31,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:15:31" (1/1) ... [2019-09-07 19:15:32,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:15:31" (1/1) ... [2019-09-07 19:15:32,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:15:31" (1/1) ... [2019-09-07 19:15:32,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:15:31" (1/1) ... [2019-09-07 19:15:32,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:15:31" (1/1) ... [2019-09-07 19:15:32,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 19:15:32,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 19:15:32,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 19:15:32,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 19:15:32,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:15:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:15:32,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 19:15:32,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 19:15:32,324 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 19:15:32,324 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 19:15:32,324 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 19:15:32,324 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 19:15:32,324 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 19:15:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 19:15:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 19:15:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 19:15:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 19:15:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 19:15:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 19:15:32,326 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 19:15:32,326 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 19:15:32,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 19:15:32,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 19:15:38,586 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 19:15:38,586 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 19:15:38,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:15:38 BoogieIcfgContainer [2019-09-07 19:15:38,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 19:15:38,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 19:15:38,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 19:15:38,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 19:15:38,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:15:29" (1/3) ... [2019-09-07 19:15:38,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b2ed19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:15:38, skipping insertion in model container [2019-09-07 19:15:38,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:15:31" (2/3) ... [2019-09-07 19:15:38,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b2ed19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:15:38, skipping insertion in model container [2019-09-07 19:15:38,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:15:38" (3/3) ... [2019-09-07 19:15:38,603 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem13_label01.c [2019-09-07 19:15:38,616 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 19:15:38,627 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 19:15:38,644 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 19:15:38,693 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 19:15:38,694 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 19:15:38,694 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 19:15:38,694 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 19:15:38,695 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 19:15:38,695 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 19:15:38,695 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 19:15:38,695 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 19:15:38,695 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 19:15:38,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states. [2019-09-07 19:15:38,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-07 19:15:38,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:15:38,755 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:15:38,757 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:15:38,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:15:38,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1163997272, now seen corresponding path program 1 times [2019-09-07 19:15:38,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:15:38,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:15:38,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:15:38,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:15:38,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:15:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:15:39,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:15:39,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:15:39,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:15:39,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:15:39,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:15:39,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:15:39,168 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand 3 states. [2019-09-07 19:15:45,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:15:45,277 INFO L93 Difference]: Finished difference Result 3094 states and 5704 transitions. [2019-09-07 19:15:45,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:15:45,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-07 19:15:45,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:15:45,321 INFO L225 Difference]: With dead ends: 3094 [2019-09-07 19:15:45,321 INFO L226 Difference]: Without dead ends: 1913 [2019-09-07 19:15:45,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:15:45,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2019-09-07 19:15:45,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1912. [2019-09-07 19:15:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1912 states. [2019-09-07 19:15:45,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 3141 transitions. [2019-09-07 19:15:45,515 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 3141 transitions. Word has length 55 [2019-09-07 19:15:45,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:15:45,519 INFO L475 AbstractCegarLoop]: Abstraction has 1912 states and 3141 transitions. [2019-09-07 19:15:45,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:15:45,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 3141 transitions. [2019-09-07 19:15:45,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-07 19:15:45,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:15:45,533 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:15:45,533 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:15:45,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:15:45,534 INFO L82 PathProgramCache]: Analyzing trace with hash -2027292131, now seen corresponding path program 1 times [2019-09-07 19:15:45,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:15:45,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:15:45,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:15:45,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:15:45,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:15:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:15:45,731 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:15:45,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:15:45,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:15:45,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:15:45,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:15:45,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:15:45,735 INFO L87 Difference]: Start difference. First operand 1912 states and 3141 transitions. Second operand 5 states. [2019-09-07 19:15:56,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:15:56,578 INFO L93 Difference]: Finished difference Result 5587 states and 9298 transitions. [2019-09-07 19:15:56,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:15:56,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-09-07 19:15:56,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:15:56,604 INFO L225 Difference]: With dead ends: 5587 [2019-09-07 19:15:56,605 INFO L226 Difference]: Without dead ends: 3681 [2019-09-07 19:15:56,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:15:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3681 states. [2019-09-07 19:15:56,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3681 to 3601. [2019-09-07 19:15:56,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3601 states. [2019-09-07 19:15:56,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3601 states to 3601 states and 5413 transitions. [2019-09-07 19:15:56,735 INFO L78 Accepts]: Start accepts. Automaton has 3601 states and 5413 transitions. Word has length 130 [2019-09-07 19:15:56,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:15:56,736 INFO L475 AbstractCegarLoop]: Abstraction has 3601 states and 5413 transitions. [2019-09-07 19:15:56,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:15:56,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3601 states and 5413 transitions. [2019-09-07 19:15:56,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-07 19:15:56,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:15:56,739 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:15:56,740 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:15:56,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:15:56,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1696487609, now seen corresponding path program 1 times [2019-09-07 19:15:56,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:15:56,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:15:56,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:15:56,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:15:56,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:15:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:15:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:15:56,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:15:56,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:15:56,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:15:56,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:15:56,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:15:56,909 INFO L87 Difference]: Start difference. First operand 3601 states and 5413 transitions. Second operand 5 states. [2019-09-07 19:16:07,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:16:07,924 INFO L93 Difference]: Finished difference Result 10901 states and 16894 transitions. [2019-09-07 19:16:07,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:16:07,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-07 19:16:07,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:16:07,969 INFO L225 Difference]: With dead ends: 10901 [2019-09-07 19:16:07,972 INFO L226 Difference]: Without dead ends: 7306 [2019-09-07 19:16:07,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:16:07,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2019-09-07 19:16:08,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7121. [2019-09-07 19:16:08,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7121 states. [2019-09-07 19:16:08,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7121 states to 7121 states and 10495 transitions. [2019-09-07 19:16:08,197 INFO L78 Accepts]: Start accepts. Automaton has 7121 states and 10495 transitions. Word has length 144 [2019-09-07 19:16:08,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:16:08,198 INFO L475 AbstractCegarLoop]: Abstraction has 7121 states and 10495 transitions. [2019-09-07 19:16:08,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:16:08,198 INFO L276 IsEmpty]: Start isEmpty. Operand 7121 states and 10495 transitions. [2019-09-07 19:16:08,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-07 19:16:08,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:16:08,201 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:16:08,201 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:16:08,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:16:08,202 INFO L82 PathProgramCache]: Analyzing trace with hash -277439651, now seen corresponding path program 1 times [2019-09-07 19:16:08,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:16:08,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:16:08,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:16:08,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:16:08,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:16:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:16:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:16:08,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:16:08,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:16:08,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:16:08,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:16:08,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:16:08,480 INFO L87 Difference]: Start difference. First operand 7121 states and 10495 transitions. Second operand 6 states. [2019-09-07 19:16:16,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:16:16,112 INFO L93 Difference]: Finished difference Result 21450 states and 33769 transitions. [2019-09-07 19:16:16,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:16:16,113 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2019-09-07 19:16:16,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:16:16,205 INFO L225 Difference]: With dead ends: 21450 [2019-09-07 19:16:16,205 INFO L226 Difference]: Without dead ends: 14335 [2019-09-07 19:16:16,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:16:16,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14335 states. [2019-09-07 19:16:16,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14335 to 14126. [2019-09-07 19:16:16,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14126 states. [2019-09-07 19:16:16,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14126 states to 14126 states and 21301 transitions. [2019-09-07 19:16:16,746 INFO L78 Accepts]: Start accepts. Automaton has 14126 states and 21301 transitions. Word has length 162 [2019-09-07 19:16:16,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:16:16,748 INFO L475 AbstractCegarLoop]: Abstraction has 14126 states and 21301 transitions. [2019-09-07 19:16:16,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:16:16,748 INFO L276 IsEmpty]: Start isEmpty. Operand 14126 states and 21301 transitions. [2019-09-07 19:16:16,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-07 19:16:16,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:16:16,751 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:16:16,752 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:16:16,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:16:16,752 INFO L82 PathProgramCache]: Analyzing trace with hash -704068966, now seen corresponding path program 1 times [2019-09-07 19:16:16,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:16:16,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:16:16,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:16:16,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:16:16,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:16:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:16:16,959 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:16:16,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:16:16,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:16:16,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:16:16,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:16:16,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:16:16,961 INFO L87 Difference]: Start difference. First operand 14126 states and 21301 transitions. Second operand 6 states. [2019-09-07 19:16:24,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:16:24,903 INFO L93 Difference]: Finished difference Result 42171 states and 69935 transitions. [2019-09-07 19:16:24,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:16:24,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 173 [2019-09-07 19:16:24,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:16:25,027 INFO L225 Difference]: With dead ends: 42171 [2019-09-07 19:16:25,027 INFO L226 Difference]: Without dead ends: 28051 [2019-09-07 19:16:25,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:16:25,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28051 states. [2019-09-07 19:16:25,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28051 to 27931. [2019-09-07 19:16:25,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27931 states. [2019-09-07 19:16:25,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27931 states to 27931 states and 41898 transitions. [2019-09-07 19:16:25,925 INFO L78 Accepts]: Start accepts. Automaton has 27931 states and 41898 transitions. Word has length 173 [2019-09-07 19:16:25,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:16:25,926 INFO L475 AbstractCegarLoop]: Abstraction has 27931 states and 41898 transitions. [2019-09-07 19:16:25,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:16:25,926 INFO L276 IsEmpty]: Start isEmpty. Operand 27931 states and 41898 transitions. [2019-09-07 19:16:25,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-07 19:16:25,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:16:25,930 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:16:25,930 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:16:25,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:16:25,931 INFO L82 PathProgramCache]: Analyzing trace with hash -795241335, now seen corresponding path program 1 times [2019-09-07 19:16:25,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:16:25,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:16:25,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:16:25,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:16:25,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:16:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:16:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:16:26,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:16:26,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:16:26,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:16:26,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:16:26,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:16:26,163 INFO L87 Difference]: Start difference. First operand 27931 states and 41898 transitions. Second operand 6 states. [2019-09-07 19:16:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:16:33,390 INFO L93 Difference]: Finished difference Result 64050 states and 97298 transitions. [2019-09-07 19:16:33,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:16:33,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 201 [2019-09-07 19:16:33,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:16:34,459 INFO L225 Difference]: With dead ends: 64050 [2019-09-07 19:16:34,460 INFO L226 Difference]: Without dead ends: 36125 [2019-09-07 19:16:34,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:16:34,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36125 states. [2019-09-07 19:16:35,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36125 to 34426. [2019-09-07 19:16:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34426 states. [2019-09-07 19:16:35,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34426 states to 34426 states and 48593 transitions. [2019-09-07 19:16:35,102 INFO L78 Accepts]: Start accepts. Automaton has 34426 states and 48593 transitions. Word has length 201 [2019-09-07 19:16:35,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:16:35,103 INFO L475 AbstractCegarLoop]: Abstraction has 34426 states and 48593 transitions. [2019-09-07 19:16:35,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:16:35,103 INFO L276 IsEmpty]: Start isEmpty. Operand 34426 states and 48593 transitions. [2019-09-07 19:16:35,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-07 19:16:35,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:16:35,110 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2019-09-07 19:16:35,110 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:16:35,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:16:35,110 INFO L82 PathProgramCache]: Analyzing trace with hash 2004665870, now seen corresponding path program 1 times [2019-09-07 19:16:35,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:16:35,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:16:35,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:16:35,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:16:35,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:16:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:16:35,314 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 169 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:16:35,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:16:35,317 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:16:35,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:16:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:16:35,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 19:16:35,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:16:35,577 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-07 19:16:35,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:16:35,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-07 19:16:35,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 19:16:35,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 19:16:35,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 19:16:35,593 INFO L87 Difference]: Start difference. First operand 34426 states and 48593 transitions. Second operand 7 states. [2019-09-07 19:16:53,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:16:53,205 INFO L93 Difference]: Finished difference Result 107910 states and 157326 transitions. [2019-09-07 19:16:53,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 19:16:53,206 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 250 [2019-09-07 19:16:53,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:16:53,540 INFO L225 Difference]: With dead ends: 107910 [2019-09-07 19:16:53,541 INFO L226 Difference]: Without dead ends: 73490 [2019-09-07 19:16:53,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-09-07 19:16:53,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73490 states. [2019-09-07 19:16:55,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73490 to 65388. [2019-09-07 19:16:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65388 states. [2019-09-07 19:16:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65388 states to 65388 states and 85895 transitions. [2019-09-07 19:16:55,610 INFO L78 Accepts]: Start accepts. Automaton has 65388 states and 85895 transitions. Word has length 250 [2019-09-07 19:16:55,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:16:55,611 INFO L475 AbstractCegarLoop]: Abstraction has 65388 states and 85895 transitions. [2019-09-07 19:16:55,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 19:16:55,612 INFO L276 IsEmpty]: Start isEmpty. Operand 65388 states and 85895 transitions. [2019-09-07 19:16:55,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-07 19:16:55,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:16:55,623 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:16:55,623 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:16:55,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:16:55,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1796061612, now seen corresponding path program 1 times [2019-09-07 19:16:55,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:16:55,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:16:55,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:16:55,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:16:55,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:16:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:16:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-07 19:16:55,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:16:55,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:16:55,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:16:55,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:16:55,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:16:55,876 INFO L87 Difference]: Start difference. First operand 65388 states and 85895 transitions. Second operand 4 states. [2019-09-07 19:17:06,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:17:06,991 INFO L93 Difference]: Finished difference Result 179755 states and 243251 transitions. [2019-09-07 19:17:06,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:17:06,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 255 [2019-09-07 19:17:06,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:17:07,404 INFO L225 Difference]: With dead ends: 179755 [2019-09-07 19:17:07,405 INFO L226 Difference]: Without dead ends: 114377 [2019-09-07 19:17:07,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:17:07,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114377 states. [2019-09-07 19:17:09,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114377 to 107040. [2019-09-07 19:17:09,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107040 states. [2019-09-07 19:17:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107040 states to 107040 states and 140711 transitions. [2019-09-07 19:17:10,307 INFO L78 Accepts]: Start accepts. Automaton has 107040 states and 140711 transitions. Word has length 255 [2019-09-07 19:17:10,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:17:10,309 INFO L475 AbstractCegarLoop]: Abstraction has 107040 states and 140711 transitions. [2019-09-07 19:17:10,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:17:10,309 INFO L276 IsEmpty]: Start isEmpty. Operand 107040 states and 140711 transitions. [2019-09-07 19:17:10,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-07 19:17:10,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:17:10,328 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:17:10,329 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:17:10,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:17:10,330 INFO L82 PathProgramCache]: Analyzing trace with hash -704267431, now seen corresponding path program 1 times [2019-09-07 19:17:10,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:17:10,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:17:10,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:17:10,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:17:10,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:17:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:17:10,778 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 7 proven. 177 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 19:17:10,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:17:10,779 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:17:10,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:17:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:17:10,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 19:17:10,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:17:10,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:17:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 19:17:11,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:17:11,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2019-09-07 19:17:11,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 19:17:11,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 19:17:11,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:17:11,150 INFO L87 Difference]: Start difference. First operand 107040 states and 140711 transitions. Second operand 11 states. [2019-09-07 19:17:41,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:17:41,382 INFO L93 Difference]: Finished difference Result 290354 states and 398734 transitions. [2019-09-07 19:17:41,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 19:17:41,383 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 294 [2019-09-07 19:17:41,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:17:42,061 INFO L225 Difference]: With dead ends: 290354 [2019-09-07 19:17:42,062 INFO L226 Difference]: Without dead ends: 183324 [2019-09-07 19:17:42,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=347, Invalid=1459, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 19:17:42,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183324 states. [2019-09-07 19:17:45,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183324 to 170571. [2019-09-07 19:17:45,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170571 states. [2019-09-07 19:17:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170571 states to 170571 states and 224513 transitions. [2019-09-07 19:17:46,094 INFO L78 Accepts]: Start accepts. Automaton has 170571 states and 224513 transitions. Word has length 294 [2019-09-07 19:17:46,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:17:46,095 INFO L475 AbstractCegarLoop]: Abstraction has 170571 states and 224513 transitions. [2019-09-07 19:17:46,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 19:17:46,095 INFO L276 IsEmpty]: Start isEmpty. Operand 170571 states and 224513 transitions. [2019-09-07 19:17:46,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2019-09-07 19:17:46,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:17:46,120 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 19:17:46,120 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:17:46,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:17:46,121 INFO L82 PathProgramCache]: Analyzing trace with hash -2112857810, now seen corresponding path program 1 times [2019-09-07 19:17:46,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:17:46,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:17:46,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:17:46,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:17:46,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:17:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:17:49,010 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 284 proven. 155 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-09-07 19:17:49,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:17:49,010 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:17:49,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:17:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:17:49,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:17:49,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:17:49,262 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 506 proven. 2 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-07 19:17:49,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:17:49,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:17:49,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:17:49,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:17:49,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:17:49,268 INFO L87 Difference]: Start difference. First operand 170571 states and 224513 transitions. Second operand 9 states. [2019-09-07 19:18:05,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:18:05,751 INFO L93 Difference]: Finished difference Result 405589 states and 571728 transitions. [2019-09-07 19:18:05,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 19:18:05,751 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 431 [2019-09-07 19:18:05,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:18:06,452 INFO L225 Difference]: With dead ends: 405589 [2019-09-07 19:18:06,452 INFO L226 Difference]: Without dead ends: 230904 [2019-09-07 19:18:06,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2019-09-07 19:18:06,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230904 states. [2019-09-07 19:18:13,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230904 to 214727. [2019-09-07 19:18:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214727 states. [2019-09-07 19:18:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214727 states to 214727 states and 296036 transitions. [2019-09-07 19:18:13,913 INFO L78 Accepts]: Start accepts. Automaton has 214727 states and 296036 transitions. Word has length 431 [2019-09-07 19:18:13,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:18:13,913 INFO L475 AbstractCegarLoop]: Abstraction has 214727 states and 296036 transitions. [2019-09-07 19:18:13,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:18:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 214727 states and 296036 transitions. [2019-09-07 19:18:13,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2019-09-07 19:18:13,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:18:13,940 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:18:13,940 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:18:13,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:18:13,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1541074637, now seen corresponding path program 1 times [2019-09-07 19:18:13,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:18:13,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:18:13,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:18:13,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:18:13,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:18:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:18:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 505 proven. 2 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2019-09-07 19:18:14,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:18:14,451 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:18:14,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:18:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:18:14,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 19:18:14,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:18:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 507 proven. 2 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2019-09-07 19:18:14,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:18:14,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-09-07 19:18:14,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 19:18:14,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 19:18:14,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:18:14,866 INFO L87 Difference]: Start difference. First operand 214727 states and 296036 transitions. Second operand 11 states. [2019-09-07 19:19:20,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:19:20,766 INFO L93 Difference]: Finished difference Result 544525 states and 769565 transitions. [2019-09-07 19:19:20,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-07 19:19:20,767 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 483 [2019-09-07 19:19:20,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:19:22,560 INFO L225 Difference]: With dead ends: 544525 [2019-09-07 19:19:22,560 INFO L226 Difference]: Without dead ends: 327268 [2019-09-07 19:19:22,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 658 GetRequests, 561 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3783 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1611, Invalid=8091, Unknown=0, NotChecked=0, Total=9702 [2019-09-07 19:19:23,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327268 states. [2019-09-07 19:19:27,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327268 to 308229. [2019-09-07 19:19:27,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308229 states. [2019-09-07 19:19:36,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308229 states to 308229 states and 393311 transitions. [2019-09-07 19:19:36,627 INFO L78 Accepts]: Start accepts. Automaton has 308229 states and 393311 transitions. Word has length 483 [2019-09-07 19:19:36,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:19:36,628 INFO L475 AbstractCegarLoop]: Abstraction has 308229 states and 393311 transitions. [2019-09-07 19:19:36,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 19:19:36,628 INFO L276 IsEmpty]: Start isEmpty. Operand 308229 states and 393311 transitions. [2019-09-07 19:19:36,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2019-09-07 19:19:36,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:19:36,645 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:19:36,645 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:19:36,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:19:36,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1895329695, now seen corresponding path program 1 times [2019-09-07 19:19:36,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:19:36,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:19:36,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:19:36,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:19:36,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:19:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:19:37,210 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 508 proven. 2 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2019-09-07 19:19:37,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:19:37,210 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:19:37,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:19:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:19:37,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:19:37,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:19:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 508 proven. 2 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2019-09-07 19:19:37,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:19:37,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:19:37,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:19:37,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:19:37,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:19:37,511 INFO L87 Difference]: Start difference. First operand 308229 states and 393311 transitions. Second operand 9 states. [2019-09-07 19:19:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:19:54,859 INFO L93 Difference]: Finished difference Result 617186 states and 787088 transitions. [2019-09-07 19:19:54,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 19:19:54,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 502 [2019-09-07 19:19:54,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:19:55,660 INFO L225 Difference]: With dead ends: 617186 [2019-09-07 19:19:55,660 INFO L226 Difference]: Without dead ends: 309688 [2019-09-07 19:19:56,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 19:19:57,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309688 states. [2019-09-07 19:20:00,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309688 to 299113. [2019-09-07 19:20:00,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299113 states. [2019-09-07 19:20:09,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299113 states to 299113 states and 357227 transitions. [2019-09-07 19:20:09,438 INFO L78 Accepts]: Start accepts. Automaton has 299113 states and 357227 transitions. Word has length 502 [2019-09-07 19:20:09,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:20:09,439 INFO L475 AbstractCegarLoop]: Abstraction has 299113 states and 357227 transitions. [2019-09-07 19:20:09,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:20:09,439 INFO L276 IsEmpty]: Start isEmpty. Operand 299113 states and 357227 transitions. [2019-09-07 19:20:09,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2019-09-07 19:20:09,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:20:09,463 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:20:09,463 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:20:09,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:20:09,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1255646254, now seen corresponding path program 1 times [2019-09-07 19:20:09,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:20:09,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:20:09,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:20:09,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:20:09,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:20:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:20:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 215 proven. 292 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 19:20:10,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:20:10,303 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:20:10,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:20:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:20:10,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:20:10,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:20:10,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:20:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 460 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 19:20:14,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:20:14,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-09-07 19:20:14,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 19:20:14,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 19:20:14,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-09-07 19:20:14,929 INFO L87 Difference]: Start difference. First operand 299113 states and 357227 transitions. Second operand 16 states. [2019-09-07 19:20:56,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:20:56,544 INFO L93 Difference]: Finished difference Result 637791 states and 766057 transitions. [2019-09-07 19:20:56,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-07 19:20:56,545 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 569 [2019-09-07 19:20:56,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:20:58,063 INFO L225 Difference]: With dead ends: 637791 [2019-09-07 19:20:58,063 INFO L226 Difference]: Without dead ends: 324539 [2019-09-07 19:20:58,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 760 GetRequests, 649 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4825 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1779, Invalid=10653, Unknown=0, NotChecked=0, Total=12432 [2019-09-07 19:20:58,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324539 states. [2019-09-07 19:21:03,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324539 to 300240. [2019-09-07 19:21:03,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300240 states. [2019-09-07 19:21:03,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300240 states to 300240 states and 344508 transitions. [2019-09-07 19:21:03,966 INFO L78 Accepts]: Start accepts. Automaton has 300240 states and 344508 transitions. Word has length 569 [2019-09-07 19:21:03,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:21:03,967 INFO L475 AbstractCegarLoop]: Abstraction has 300240 states and 344508 transitions. [2019-09-07 19:21:03,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 19:21:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 300240 states and 344508 transitions. [2019-09-07 19:21:03,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2019-09-07 19:21:03,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:21:03,998 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:21:03,998 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:21:03,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:21:03,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2118221892, now seen corresponding path program 1 times [2019-09-07 19:21:03,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:21:03,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:21:03,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:21:03,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:21:03,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:21:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:21:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1549 backedges. 758 proven. 2 refuted. 0 times theorem prover too weak. 789 trivial. 0 not checked. [2019-09-07 19:21:05,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:21:05,302 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:21:05,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:21:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:21:05,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 19:21:05,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:21:06,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1549 backedges. 758 proven. 2 refuted. 0 times theorem prover too weak. 789 trivial. 0 not checked. [2019-09-07 19:21:06,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:21:06,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-09-07 19:21:06,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:21:06,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:21:06,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:21:06,222 INFO L87 Difference]: Start difference. First operand 300240 states and 344508 transitions. Second operand 6 states. [2019-09-07 19:21:20,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:21:20,474 INFO L93 Difference]: Finished difference Result 649027 states and 744217 transitions. [2019-09-07 19:21:20,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:21:20,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 679 [2019-09-07 19:21:20,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:21:21,358 INFO L225 Difference]: With dead ends: 649027 [2019-09-07 19:21:21,358 INFO L226 Difference]: Without dead ends: 377027 [2019-09-07 19:21:21,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 683 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:21:21,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377027 states. [2019-09-07 19:21:33,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377027 to 372983. [2019-09-07 19:21:33,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372983 states. [2019-09-07 19:21:34,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372983 states to 372983 states and 418283 transitions. [2019-09-07 19:21:34,875 INFO L78 Accepts]: Start accepts. Automaton has 372983 states and 418283 transitions. Word has length 679 [2019-09-07 19:21:34,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:21:34,876 INFO L475 AbstractCegarLoop]: Abstraction has 372983 states and 418283 transitions. [2019-09-07 19:21:34,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:21:34,876 INFO L276 IsEmpty]: Start isEmpty. Operand 372983 states and 418283 transitions. [2019-09-07 19:21:34,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2019-09-07 19:21:34,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:21:34,910 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:21:34,910 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:21:34,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:21:34,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1609889553, now seen corresponding path program 1 times [2019-09-07 19:21:34,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:21:34,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:21:34,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:21:34,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:21:34,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:21:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:21:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 427 proven. 47 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-07 19:21:36,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:21:36,316 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:21:36,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:21:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:21:36,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 19:21:36,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:21:36,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:21:36,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:21:36,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:21:36,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:21:36,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:21:36,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:21:36,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:21:36,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:21:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 427 proven. 47 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 19:21:37,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:21:37,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-09-07 19:21:37,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 19:21:37,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 19:21:37,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:21:37,150 INFO L87 Difference]: Start difference. First operand 372983 states and 418283 transitions. Second operand 8 states. [2019-09-07 19:21:58,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:21:58,309 INFO L93 Difference]: Finished difference Result 883249 states and 994687 transitions. [2019-09-07 19:21:58,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 19:21:58,310 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 698 [2019-09-07 19:21:58,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:21:59,768 INFO L225 Difference]: With dead ends: 883249 [2019-09-07 19:21:59,768 INFO L226 Difference]: Without dead ends: 514202 [2019-09-07 19:22:00,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 705 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-07 19:22:01,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514202 states. [2019-09-07 19:22:12,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514202 to 481652. [2019-09-07 19:22:12,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481652 states. [2019-09-07 19:22:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481652 states to 481652 states and 538181 transitions. [2019-09-07 19:22:13,333 INFO L78 Accepts]: Start accepts. Automaton has 481652 states and 538181 transitions. Word has length 698 [2019-09-07 19:22:13,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:22:13,334 INFO L475 AbstractCegarLoop]: Abstraction has 481652 states and 538181 transitions. [2019-09-07 19:22:13,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 19:22:13,334 INFO L276 IsEmpty]: Start isEmpty. Operand 481652 states and 538181 transitions. [2019-09-07 19:22:13,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 824 [2019-09-07 19:22:13,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:22:13,399 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:22:13,400 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:22:13,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:22:13,400 INFO L82 PathProgramCache]: Analyzing trace with hash -912775636, now seen corresponding path program 1 times [2019-09-07 19:22:13,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:22:13,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:22:13,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:22:13,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:22:13,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:22:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:22:20,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 714 proven. 168 refuted. 0 times theorem prover too weak. 897 trivial. 0 not checked. [2019-09-07 19:22:20,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:22:20,620 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:22:20,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:22:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:22:20,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 1229 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:22:20,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:22:20,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:22:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 916 proven. 2 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-09-07 19:22:21,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:22:21,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2019-09-07 19:22:21,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 19:22:21,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 19:22:21,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-07 19:22:21,419 INFO L87 Difference]: Start difference. First operand 481652 states and 538181 transitions. Second operand 12 states. [2019-09-07 19:23:21,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:23:21,912 INFO L93 Difference]: Finished difference Result 1119852 states and 1301814 transitions. [2019-09-07 19:23:21,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-09-07 19:23:21,912 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 823 [2019-09-07 19:23:21,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:23:24,872 INFO L225 Difference]: With dead ends: 1119852 [2019-09-07 19:23:24,872 INFO L226 Difference]: Without dead ends: 642165 [2019-09-07 19:23:25,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1037 GetRequests, 917 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5942 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1962, Invalid=12800, Unknown=0, NotChecked=0, Total=14762 [2019-09-07 19:23:25,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642165 states. [2019-09-07 19:23:44,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642165 to 618690. [2019-09-07 19:23:44,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618690 states. [2019-09-07 19:23:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618690 states to 618690 states and 686553 transitions. [2019-09-07 19:23:45,361 INFO L78 Accepts]: Start accepts. Automaton has 618690 states and 686553 transitions. Word has length 823 [2019-09-07 19:23:45,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:23:45,361 INFO L475 AbstractCegarLoop]: Abstraction has 618690 states and 686553 transitions. [2019-09-07 19:23:45,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 19:23:45,362 INFO L276 IsEmpty]: Start isEmpty. Operand 618690 states and 686553 transitions. [2019-09-07 19:23:45,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 995 [2019-09-07 19:23:45,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:23:45,421 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:23:45,421 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:23:45,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:23:45,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1926160076, now seen corresponding path program 1 times [2019-09-07 19:23:45,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:23:45,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:23:45,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:23:45,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:23:45,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:23:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:23:53,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1022 backedges. 377 proven. 88 refuted. 0 times theorem prover too weak. 557 trivial. 0 not checked. [2019-09-07 19:23:53,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:23:53,272 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:23:53,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:23:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:23:53,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 1367 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 19:23:53,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:23:53,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:23:53,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:23:53,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:23:54,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1022 backedges. 869 proven. 2 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 19:23:54,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:23:54,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 19:23:54,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 19:23:54,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 19:23:54,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-07 19:23:54,279 INFO L87 Difference]: Start difference. First operand 618690 states and 686553 transitions. Second operand 10 states. [2019-09-07 19:24:18,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:24:18,027 INFO L93 Difference]: Finished difference Result 1195267 states and 1328057 transitions. [2019-09-07 19:24:18,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 19:24:18,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 994 [2019-09-07 19:24:18,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:24:20,706 INFO L225 Difference]: With dead ends: 1195267 [2019-09-07 19:24:20,707 INFO L226 Difference]: Without dead ends: 601620 [2019-09-07 19:24:21,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1040 GetRequests, 1011 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2019-09-07 19:24:21,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601620 states. [2019-09-07 19:24:38,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601620 to 588077. [2019-09-07 19:24:38,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588077 states. [2019-09-07 19:24:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588077 states to 588077 states and 642629 transitions. [2019-09-07 19:24:40,528 INFO L78 Accepts]: Start accepts. Automaton has 588077 states and 642629 transitions. Word has length 994 [2019-09-07 19:24:40,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:24:40,529 INFO L475 AbstractCegarLoop]: Abstraction has 588077 states and 642629 transitions. [2019-09-07 19:24:40,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 19:24:40,529 INFO L276 IsEmpty]: Start isEmpty. Operand 588077 states and 642629 transitions. [2019-09-07 19:24:40,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1115 [2019-09-07 19:24:40,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:24:40,599 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:24:40,599 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:24:40,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:24:40,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1711028571, now seen corresponding path program 1 times [2019-09-07 19:24:40,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:24:40,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:24:40,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:24:40,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:24:40,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:24:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:24:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1775 backedges. 973 proven. 490 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-07 19:24:49,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:24:49,275 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:24:49,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:24:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:24:49,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 1507 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 19:24:49,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:24:49,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:24:49,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:24:49,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:24:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1775 backedges. 1274 proven. 2 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2019-09-07 19:24:50,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:24:50,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-09-07 19:24:50,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 19:24:50,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 19:24:50,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-07 19:24:50,541 INFO L87 Difference]: Start difference. First operand 588077 states and 642629 transitions. Second operand 12 states. [2019-09-07 19:25:47,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:25:47,447 INFO L93 Difference]: Finished difference Result 1263032 states and 1384354 transitions. [2019-09-07 19:25:47,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-09-07 19:25:47,447 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1114 [2019-09-07 19:25:47,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:25:49,043 INFO L225 Difference]: With dead ends: 1263032 [2019-09-07 19:25:49,043 INFO L226 Difference]: Without dead ends: 685418 [2019-09-07 19:25:49,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1323 GetRequests, 1207 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5490 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1735, Invalid=12071, Unknown=0, NotChecked=0, Total=13806 [2019-09-07 19:25:51,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685418 states. [2019-09-07 19:26:09,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685418 to 634510. [2019-09-07 19:26:09,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634510 states. [2019-09-07 19:26:11,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634510 states to 634510 states and 691789 transitions. [2019-09-07 19:26:11,472 INFO L78 Accepts]: Start accepts. Automaton has 634510 states and 691789 transitions. Word has length 1114 [2019-09-07 19:26:11,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:26:11,472 INFO L475 AbstractCegarLoop]: Abstraction has 634510 states and 691789 transitions. [2019-09-07 19:26:11,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 19:26:11,473 INFO L276 IsEmpty]: Start isEmpty. Operand 634510 states and 691789 transitions. [2019-09-07 19:26:11,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1142 [2019-09-07 19:26:11,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:26:11,525 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:26:11,525 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:26:11,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:26:11,526 INFO L82 PathProgramCache]: Analyzing trace with hash 218778861, now seen corresponding path program 1 times [2019-09-07 19:26:11,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:26:11,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:26:11,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:26:11,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:26:11,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:26:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:26:20,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1915 backedges. 689 proven. 582 refuted. 0 times theorem prover too weak. 644 trivial. 0 not checked. [2019-09-07 19:26:20,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:26:20,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:26:20,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:26:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:26:20,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 1536 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:26:20,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:26:21,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1915 backedges. 1414 proven. 2 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2019-09-07 19:26:21,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:26:21,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-09-07 19:26:21,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 19:26:21,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 19:26:21,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-09-07 19:26:21,468 INFO L87 Difference]: Start difference. First operand 634510 states and 691789 transitions. Second operand 12 states.