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/Problem14_label46.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:11:39,871 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:11:39,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:11:39,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:11:39,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:11:39,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:11:39,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:11:39,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:11:39,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:11:39,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:11:39,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:11:39,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:11:39,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:11:39,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:11:39,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:11:39,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:11:39,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:11:39,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:11:39,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:11:39,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:11:39,905 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:11:39,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:11:39,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:11:39,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:11:39,911 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:11:39,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:11:39,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:11:39,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:11:39,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:11:39,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:11:39,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:11:39,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:11:39,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:11:39,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:11:39,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:11:39,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:11:39,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:11:39,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:11:39,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:11:39,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:11:39,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:11:39,921 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 20:11:39,940 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:11:39,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:11:39,941 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:11:39,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:11:39,942 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:11:39,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:11:39,942 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:11:39,942 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:11:39,943 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:11:39,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:11:39,944 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:11:39,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:11:39,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:11:39,944 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:11:39,945 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:11:39,945 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:11:39,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:11:39,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:11:39,946 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:11:39,946 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:11:39,946 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:11:39,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:11:39,946 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:11:39,947 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:11:39,947 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:11:39,947 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:11:39,948 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:11:39,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:11:39,948 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:11:39,990 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:11:40,003 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:11:40,006 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:11:40,008 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:11:40,008 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:11:40,009 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label46.c [2019-09-07 20:11:40,071 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54f4a9395/1edd07fdb6d2496cbd3362c5ffd58805/FLAG6da16b711 [2019-09-07 20:11:40,646 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:11:40,647 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label46.c [2019-09-07 20:11:40,672 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54f4a9395/1edd07fdb6d2496cbd3362c5ffd58805/FLAG6da16b711 [2019-09-07 20:11:40,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54f4a9395/1edd07fdb6d2496cbd3362c5ffd58805 [2019-09-07 20:11:40,926 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:11:40,928 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:11:40,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:11:40,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:11:40,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:11:40,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:11:40" (1/1) ... [2019-09-07 20:11:40,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e667064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:11:40, skipping insertion in model container [2019-09-07 20:11:40,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:11:40" (1/1) ... [2019-09-07 20:11:40,945 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:11:41,011 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:11:41,579 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:11:41,584 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:11:41,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:11:41,863 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:11:41,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:11:41 WrapperNode [2019-09-07 20:11:41,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:11:41,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:11:41,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:11:41,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:11:41,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:11:41" (1/1) ... [2019-09-07 20:11:41,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:11:41" (1/1) ... [2019-09-07 20:11:41,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:11:41" (1/1) ... [2019-09-07 20:11:41,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:11:41" (1/1) ... [2019-09-07 20:11:42,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:11:41" (1/1) ... [2019-09-07 20:11:42,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:11:41" (1/1) ... [2019-09-07 20:11:42,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:11:41" (1/1) ... [2019-09-07 20:11:42,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:11:42,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:11:42,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:11:42,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:11:42,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:11:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:11:42,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:11:42,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:11:42,152 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:11:42,153 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:11:42,153 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:11:42,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:11:42,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:11:42,154 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:11:42,154 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:11:42,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:11:42,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:11:43,853 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:11:43,853 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:11:43,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:11:43 BoogieIcfgContainer [2019-09-07 20:11:43,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:11:43,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:11:43,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:11:43,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:11:43,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:11:40" (1/3) ... [2019-09-07 20:11:43,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66fd50da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:11:43, skipping insertion in model container [2019-09-07 20:11:43,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:11:41" (2/3) ... [2019-09-07 20:11:43,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66fd50da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:11:43, skipping insertion in model container [2019-09-07 20:11:43,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:11:43" (3/3) ... [2019-09-07 20:11:43,868 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label46.c [2019-09-07 20:11:43,879 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:11:43,887 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:11:43,904 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:11:43,938 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:11:43,939 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:11:43,940 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:11:43,941 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:11:43,941 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:11:43,942 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:11:43,942 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:11:43,942 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:11:43,942 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:11:43,987 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-09-07 20:11:43,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-07 20:11:43,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:11:43,996 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] [2019-09-07 20:11:43,998 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:11:44,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:11:44,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1982153494, now seen corresponding path program 1 times [2019-09-07 20:11:44,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:11:44,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:11:44,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:11:44,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:11:44,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:11:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:11:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:11:44,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:11:44,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:11:44,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:11:44,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:11:44,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:11:44,380 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2019-09-07 20:11:45,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:11:45,702 INFO L93 Difference]: Finished difference Result 688 states and 1223 transitions. [2019-09-07 20:11:45,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:11:45,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-07 20:11:45,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:11:45,734 INFO L225 Difference]: With dead ends: 688 [2019-09-07 20:11:45,735 INFO L226 Difference]: Without dead ends: 372 [2019-09-07 20:11:45,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 20:11:45,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-09-07 20:11:45,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2019-09-07 20:11:45,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-09-07 20:11:45,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 602 transitions. [2019-09-07 20:11:45,859 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 602 transitions. Word has length 45 [2019-09-07 20:11:45,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:11:45,860 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 602 transitions. [2019-09-07 20:11:45,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:11:45,860 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 602 transitions. [2019-09-07 20:11:45,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-07 20:11:45,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:11:45,866 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:11:45,867 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:11:45,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:11:45,867 INFO L82 PathProgramCache]: Analyzing trace with hash -2001960122, now seen corresponding path program 1 times [2019-09-07 20:11:45,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:11:45,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:11:45,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:11:45,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:11:45,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:11:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:11:46,059 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:11:46,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:11:46,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 20:11:46,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:11:46,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:11:46,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:11:46,063 INFO L87 Difference]: Start difference. First operand 372 states and 602 transitions. Second operand 6 states. [2019-09-07 20:11:47,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:11:47,273 INFO L93 Difference]: Finished difference Result 936 states and 1526 transitions. [2019-09-07 20:11:47,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 20:11:47,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-09-07 20:11:47,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:11:47,281 INFO L225 Difference]: With dead ends: 936 [2019-09-07 20:11:47,281 INFO L226 Difference]: Without dead ends: 570 [2019-09-07 20:11:47,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:11:47,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-09-07 20:11:47,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 562. [2019-09-07 20:11:47,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-07 20:11:47,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 814 transitions. [2019-09-07 20:11:47,316 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 814 transitions. Word has length 131 [2019-09-07 20:11:47,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:11:47,317 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 814 transitions. [2019-09-07 20:11:47,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:11:47,317 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 814 transitions. [2019-09-07 20:11:47,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-07 20:11:47,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:11:47,320 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:11:47,321 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:11:47,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:11:47,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1605993387, now seen corresponding path program 1 times [2019-09-07 20:11:47,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:11:47,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:11:47,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:11:47,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:11:47,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:11:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:11:47,435 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:11:47,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:11:47,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:11:47,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:11:47,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:11:47,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:11:47,437 INFO L87 Difference]: Start difference. First operand 562 states and 814 transitions. Second operand 4 states. [2019-09-07 20:11:48,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:11:48,957 INFO L93 Difference]: Finished difference Result 2220 states and 3283 transitions. [2019-09-07 20:11:48,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:11:48,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-07 20:11:48,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:11:48,973 INFO L225 Difference]: With dead ends: 2220 [2019-09-07 20:11:48,974 INFO L226 Difference]: Without dead ends: 1664 [2019-09-07 20:11:48,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:11:48,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2019-09-07 20:11:49,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1664. [2019-09-07 20:11:49,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1664 states. [2019-09-07 20:11:49,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2318 transitions. [2019-09-07 20:11:49,064 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2318 transitions. Word has length 140 [2019-09-07 20:11:49,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:11:49,067 INFO L475 AbstractCegarLoop]: Abstraction has 1664 states and 2318 transitions. [2019-09-07 20:11:49,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:11:49,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2318 transitions. [2019-09-07 20:11:49,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-07 20:11:49,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:11:49,093 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:11:49,093 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:11:49,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:11:49,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1305779353, now seen corresponding path program 1 times [2019-09-07 20:11:49,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:11:49,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:11:49,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:11:49,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:11:49,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:11:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:11:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 176 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:11:49,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:11:49,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:11:49,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:11:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:11:49,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 20:11:49,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:11:49,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:11:50,083 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-07 20:11:50,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:11:50,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 20:11:50,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:11:50,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:11:50,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:11:50,100 INFO L87 Difference]: Start difference. First operand 1664 states and 2318 transitions. Second operand 9 states. [2019-09-07 20:11:53,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:11:53,650 INFO L93 Difference]: Finished difference Result 5417 states and 7881 transitions. [2019-09-07 20:11:53,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 20:11:53,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 262 [2019-09-07 20:11:53,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:11:53,673 INFO L225 Difference]: With dead ends: 5417 [2019-09-07 20:11:53,674 INFO L226 Difference]: Without dead ends: 3750 [2019-09-07 20:11:53,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 267 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2019-09-07 20:11:53,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3750 states. [2019-09-07 20:11:53,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3750 to 2814. [2019-09-07 20:11:53,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2814 states. [2019-09-07 20:11:53,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2814 states and 3944 transitions. [2019-09-07 20:11:53,818 INFO L78 Accepts]: Start accepts. Automaton has 2814 states and 3944 transitions. Word has length 262 [2019-09-07 20:11:53,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:11:53,819 INFO L475 AbstractCegarLoop]: Abstraction has 2814 states and 3944 transitions. [2019-09-07 20:11:53,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:11:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 3944 transitions. [2019-09-07 20:11:53,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-07 20:11:53,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:11:53,830 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:11:53,830 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:11:53,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:11:53,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1437726563, now seen corresponding path program 1 times [2019-09-07 20:11:53,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:11:53,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:11:53,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:11:53,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:11:53,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:11:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:11:55,262 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 200 proven. 183 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 20:11:55,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:11:55,262 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:11:55,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:11:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:11:55,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:11:55,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:11:55,530 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 304 proven. 2 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-07 20:11:55,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:11:55,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-09-07 20:11:55,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 20:11:55,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 20:11:55,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-09-07 20:11:55,536 INFO L87 Difference]: Start difference. First operand 2814 states and 3944 transitions. Second operand 15 states. [2019-09-07 20:11:59,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:11:59,793 INFO L93 Difference]: Finished difference Result 7234 states and 10075 transitions. [2019-09-07 20:11:59,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 20:11:59,794 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 364 [2019-09-07 20:11:59,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:11:59,814 INFO L225 Difference]: With dead ends: 7234 [2019-09-07 20:11:59,815 INFO L226 Difference]: Without dead ends: 4346 [2019-09-07 20:11:59,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=392, Invalid=1500, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 20:11:59,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2019-09-07 20:11:59,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 3932. [2019-09-07 20:11:59,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3932 states. [2019-09-07 20:11:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3932 states to 3932 states and 4824 transitions. [2019-09-07 20:11:59,999 INFO L78 Accepts]: Start accepts. Automaton has 3932 states and 4824 transitions. Word has length 364 [2019-09-07 20:11:59,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:11:59,999 INFO L475 AbstractCegarLoop]: Abstraction has 3932 states and 4824 transitions. [2019-09-07 20:11:59,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 20:12:00,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3932 states and 4824 transitions. [2019-09-07 20:12:00,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2019-09-07 20:12:00,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:12:00,015 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:12:00,015 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:12:00,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:12:00,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1523014223, now seen corresponding path program 1 times [2019-09-07 20:12:00,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:12:00,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:12:00,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:00,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:00,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:00,608 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 380 proven. 112 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-09-07 20:12:00,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:12:00,609 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:12:00,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:00,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 20:12:00,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:12:00,868 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 664 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:12:00,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:12:00,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 7 [2019-09-07 20:12:00,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:12:00,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:12:00,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:12:00,876 INFO L87 Difference]: Start difference. First operand 3932 states and 4824 transitions. Second operand 7 states. [2019-09-07 20:12:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:12:02,486 INFO L93 Difference]: Finished difference Result 8796 states and 11020 transitions. [2019-09-07 20:12:02,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 20:12:02,486 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 510 [2019-09-07 20:12:02,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:12:02,509 INFO L225 Difference]: With dead ends: 8796 [2019-09-07 20:12:02,509 INFO L226 Difference]: Without dead ends: 5052 [2019-09-07 20:12:02,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 516 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:12:02,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5052 states. [2019-09-07 20:12:02,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5052 to 4498. [2019-09-07 20:12:02,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4498 states. [2019-09-07 20:12:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4498 states to 4498 states and 5548 transitions. [2019-09-07 20:12:02,631 INFO L78 Accepts]: Start accepts. Automaton has 4498 states and 5548 transitions. Word has length 510 [2019-09-07 20:12:02,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:12:02,632 INFO L475 AbstractCegarLoop]: Abstraction has 4498 states and 5548 transitions. [2019-09-07 20:12:02,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:12:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 4498 states and 5548 transitions. [2019-09-07 20:12:02,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2019-09-07 20:12:02,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:12:02,652 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:12:02,652 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:12:02,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:12:02,653 INFO L82 PathProgramCache]: Analyzing trace with hash 344488873, now seen corresponding path program 1 times [2019-09-07 20:12:02,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:12:02,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:12:02,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:02,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:02,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1185 backedges. 513 proven. 482 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-07 20:12:03,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:12:03,799 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:12:03,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:03,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 20:12:03,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:12:04,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:12:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1185 backedges. 873 proven. 2 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-09-07 20:12:04,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:12:04,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 13 [2019-09-07 20:12:04,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:12:04,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:12:04,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:12:04,372 INFO L87 Difference]: Start difference. First operand 4498 states and 5548 transitions. Second operand 13 states. [2019-09-07 20:12:06,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:12:06,653 INFO L93 Difference]: Finished difference Result 8985 states and 11579 transitions. [2019-09-07 20:12:06,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 20:12:06,654 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 594 [2019-09-07 20:12:06,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:12:06,681 INFO L225 Difference]: With dead ends: 8985 [2019-09-07 20:12:06,682 INFO L226 Difference]: Without dead ends: 4632 [2019-09-07 20:12:06,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2019-09-07 20:12:06,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2019-09-07 20:12:06,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4508. [2019-09-07 20:12:06,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4508 states. [2019-09-07 20:12:06,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4508 states to 4508 states and 5308 transitions. [2019-09-07 20:12:06,818 INFO L78 Accepts]: Start accepts. Automaton has 4508 states and 5308 transitions. Word has length 594 [2019-09-07 20:12:06,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:12:06,818 INFO L475 AbstractCegarLoop]: Abstraction has 4508 states and 5308 transitions. [2019-09-07 20:12:06,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:12:06,819 INFO L276 IsEmpty]: Start isEmpty. Operand 4508 states and 5308 transitions. [2019-09-07 20:12:06,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2019-09-07 20:12:06,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:12:06,849 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-09-07 20:12:06,850 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:12:06,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:12:06,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1431252605, now seen corresponding path program 2 times [2019-09-07 20:12:06,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:12:06,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:12:06,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:06,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:06,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:08,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 539 proven. 534 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-09-07 20:12:08,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:12:08,218 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:12:08,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 20:12:08,398 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 20:12:08,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 20:12:08,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 20:12:08,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:12:08,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:12:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 925 proven. 2 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:12:08,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:12:08,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2019-09-07 20:12:08,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 20:12:08,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 20:12:08,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-09-07 20:12:08,820 INFO L87 Difference]: Start difference. First operand 4508 states and 5308 transitions. Second operand 18 states. [2019-09-07 20:12:10,794 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-09-07 20:12:12,124 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-07 20:12:12,245 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-07 20:12:12,467 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-07 20:12:12,713 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-07 20:12:13,378 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-07 20:12:14,128 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-07 20:12:14,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:12:14,261 INFO L93 Difference]: Finished difference Result 10686 states and 12665 transitions. [2019-09-07 20:12:14,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 20:12:14,262 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 620 [2019-09-07 20:12:14,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:12:14,302 INFO L225 Difference]: With dead ends: 10686 [2019-09-07 20:12:14,302 INFO L226 Difference]: Without dead ends: 6366 [2019-09-07 20:12:14,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 642 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=494, Invalid=2056, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 20:12:14,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6366 states. [2019-09-07 20:12:14,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6366 to 5422. [2019-09-07 20:12:14,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5422 states. [2019-09-07 20:12:14,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5422 states to 5422 states and 6295 transitions. [2019-09-07 20:12:14,456 INFO L78 Accepts]: Start accepts. Automaton has 5422 states and 6295 transitions. Word has length 620 [2019-09-07 20:12:14,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:12:14,457 INFO L475 AbstractCegarLoop]: Abstraction has 5422 states and 6295 transitions. [2019-09-07 20:12:14,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 20:12:14,458 INFO L276 IsEmpty]: Start isEmpty. Operand 5422 states and 6295 transitions. [2019-09-07 20:12:14,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 742 [2019-09-07 20:12:14,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:12:14,473 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:12:14,473 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:12:14,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:12:14,474 INFO L82 PathProgramCache]: Analyzing trace with hash -154604698, now seen corresponding path program 1 times [2019-09-07 20:12:14,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:12:14,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:12:14,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:14,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 20:12:14,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:14,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1894 backedges. 589 proven. 224 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-09-07 20:12:14,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:12:14,982 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:12:14,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:15,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:12:15,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:12:15,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1894 backedges. 1380 proven. 2 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-09-07 20:12:15,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:12:15,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 20:12:15,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:12:15,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:12:15,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:12:15,429 INFO L87 Difference]: Start difference. First operand 5422 states and 6295 transitions. Second operand 6 states. [2019-09-07 20:12:16,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:12:16,417 INFO L93 Difference]: Finished difference Result 11940 states and 13999 transitions. [2019-09-07 20:12:16,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 20:12:16,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 741 [2019-09-07 20:12:16,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:12:16,446 INFO L225 Difference]: With dead ends: 11940 [2019-09-07 20:12:16,446 INFO L226 Difference]: Without dead ends: 6706 [2019-09-07 20:12:16,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 755 GetRequests, 746 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:12:16,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6706 states. [2019-09-07 20:12:16,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6706 to 6698. [2019-09-07 20:12:16,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6698 states. [2019-09-07 20:12:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6698 states to 6698 states and 7724 transitions. [2019-09-07 20:12:16,576 INFO L78 Accepts]: Start accepts. Automaton has 6698 states and 7724 transitions. Word has length 741 [2019-09-07 20:12:16,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:12:16,577 INFO L475 AbstractCegarLoop]: Abstraction has 6698 states and 7724 transitions. [2019-09-07 20:12:16,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:12:16,577 INFO L276 IsEmpty]: Start isEmpty. Operand 6698 states and 7724 transitions. [2019-09-07 20:12:16,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 782 [2019-09-07 20:12:16,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:12:16,592 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:12:16,592 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:12:16,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:12:16,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1030932962, now seen corresponding path program 1 times [2019-09-07 20:12:16,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:12:16,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:12:16,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:16,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:16,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:18,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2216 backedges. 744 proven. 1111 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-07 20:12:18,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:12:18,011 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 20:12:18,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:18,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 1150 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 20:12:18,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:12:18,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:12:18,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2216 backedges. 1324 proven. 2 refuted. 0 times theorem prover too weak. 890 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:12:18,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:12:18,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-09-07 20:12:18,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 20:12:18,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 20:12:18,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-09-07 20:12:18,978 INFO L87 Difference]: Start difference. First operand 6698 states and 7724 transitions. Second operand 14 states. [2019-09-07 20:12:24,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:12:24,887 INFO L93 Difference]: Finished difference Result 13608 states and 16357 transitions. [2019-09-07 20:12:24,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-07 20:12:24,888 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 781 [2019-09-07 20:12:24,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:12:24,920 INFO L225 Difference]: With dead ends: 13608 [2019-09-07 20:12:24,921 INFO L226 Difference]: Without dead ends: 6910 [2019-09-07 20:12:24,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 884 GetRequests, 822 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=638, Invalid=3394, Unknown=0, NotChecked=0, Total=4032 [2019-09-07 20:12:24,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6910 states. [2019-09-07 20:12:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6910 to 6350. [2019-09-07 20:12:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6350 states. [2019-09-07 20:12:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6350 states to 6350 states and 7270 transitions. [2019-09-07 20:12:25,193 INFO L78 Accepts]: Start accepts. Automaton has 6350 states and 7270 transitions. Word has length 781 [2019-09-07 20:12:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:12:25,194 INFO L475 AbstractCegarLoop]: Abstraction has 6350 states and 7270 transitions. [2019-09-07 20:12:25,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 20:12:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand 6350 states and 7270 transitions. [2019-09-07 20:12:25,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1107 [2019-09-07 20:12:25,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:12:25,221 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-07 20:12:25,222 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:12:25,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:12:25,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1606370089, now seen corresponding path program 1 times [2019-09-07 20:12:25,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:12:25,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:12:25,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:25,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:25,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:26,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3601 backedges. 901 proven. 872 refuted. 0 times theorem prover too weak. 1828 trivial. 0 not checked. [2019-09-07 20:12:26,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:12:26,630 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 20:12:26,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:26,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:12:26,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:12:27,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3601 backedges. 2467 proven. 2 refuted. 0 times theorem prover too weak. 1132 trivial. 0 not checked. [2019-09-07 20:12:27,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:12:27,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-09-07 20:12:27,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 20:12:27,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 20:12:27,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-07 20:12:27,530 INFO L87 Difference]: Start difference. First operand 6350 states and 7270 transitions. Second operand 14 states. [2019-09-07 20:12:34,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:12:34,009 INFO L93 Difference]: Finished difference Result 14934 states and 17084 transitions. [2019-09-07 20:12:34,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-07 20:12:34,010 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1106 [2019-09-07 20:12:34,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:12:34,031 INFO L225 Difference]: With dead ends: 14934 [2019-09-07 20:12:34,031 INFO L226 Difference]: Without dead ends: 8772 [2019-09-07 20:12:34,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1247 GetRequests, 1160 SyntacticMatches, 3 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2685 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1228, Invalid=6082, Unknown=0, NotChecked=0, Total=7310 [2019-09-07 20:12:34,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8772 states. [2019-09-07 20:12:34,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8772 to 7304. [2019-09-07 20:12:34,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2019-09-07 20:12:34,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 8199 transitions. [2019-09-07 20:12:34,197 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 8199 transitions. Word has length 1106 [2019-09-07 20:12:34,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:12:34,198 INFO L475 AbstractCegarLoop]: Abstraction has 7304 states and 8199 transitions. [2019-09-07 20:12:34,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 20:12:34,199 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 8199 transitions. [2019-09-07 20:12:34,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1298 [2019-09-07 20:12:34,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:12:34,231 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:12:34,231 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:12:34,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:12:34,232 INFO L82 PathProgramCache]: Analyzing trace with hash -498483510, now seen corresponding path program 1 times [2019-09-07 20:12:34,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:12:34,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:12:34,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:34,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:34,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5046 backedges. 1000 proven. 2498 refuted. 0 times theorem prover too weak. 1548 trivial. 0 not checked. [2019-09-07 20:12:37,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:12:37,832 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 20:12:37,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:38,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 1781 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 20:12:38,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:12:38,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:12:39,285 INFO L134 CoverageAnalysis]: Checked inductivity of 5046 backedges. 2655 proven. 2 refuted. 0 times theorem prover too weak. 2389 trivial. 0 not checked. [2019-09-07 20:12:39,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:12:39,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6] total 20 [2019-09-07 20:12:39,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 20:12:39,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 20:12:39,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2019-09-07 20:12:39,293 INFO L87 Difference]: Start difference. First operand 7304 states and 8199 transitions. Second operand 20 states. [2019-09-07 20:12:44,218 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-07 20:12:45,359 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-09-07 20:12:46,244 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-07 20:12:47,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:12:47,961 INFO L93 Difference]: Finished difference Result 16042 states and 18333 transitions. [2019-09-07 20:12:47,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-07 20:12:47,962 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1297 [2019-09-07 20:12:47,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:12:47,987 INFO L225 Difference]: With dead ends: 16042 [2019-09-07 20:12:47,987 INFO L226 Difference]: Without dead ends: 8744 [2019-09-07 20:12:48,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1403 GetRequests, 1323 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1925 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1119, Invalid=5201, Unknown=0, NotChecked=0, Total=6320 [2019-09-07 20:12:48,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8744 states. [2019-09-07 20:12:48,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8744 to 7496. [2019-09-07 20:12:48,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7496 states. [2019-09-07 20:12:48,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7496 states to 7496 states and 8151 transitions. [2019-09-07 20:12:48,175 INFO L78 Accepts]: Start accepts. Automaton has 7496 states and 8151 transitions. Word has length 1297 [2019-09-07 20:12:48,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:12:48,177 INFO L475 AbstractCegarLoop]: Abstraction has 7496 states and 8151 transitions. [2019-09-07 20:12:48,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 20:12:48,177 INFO L276 IsEmpty]: Start isEmpty. Operand 7496 states and 8151 transitions. [2019-09-07 20:12:48,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1581 [2019-09-07 20:12:48,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:12:48,228 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:12:48,229 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:12:48,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:12:48,230 INFO L82 PathProgramCache]: Analyzing trace with hash -889351995, now seen corresponding path program 1 times [2019-09-07 20:12:48,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:12:48,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:12:48,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:48,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:48,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:51,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7528 backedges. 1560 proven. 1159 refuted. 0 times theorem prover too weak. 4809 trivial. 0 not checked. [2019-09-07 20:12:51,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:12:51,584 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 20:12:51,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:51,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 2140 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 20:12:51,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:12:52,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:12:53,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7528 backedges. 2749 proven. 2 refuted. 0 times theorem prover too weak. 4777 trivial. 0 not checked. [2019-09-07 20:12:53,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:12:53,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2019-09-07 20:12:53,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 20:12:53,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 20:12:53,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-09-07 20:12:53,245 INFO L87 Difference]: Start difference. First operand 7496 states and 8151 transitions. Second operand 17 states. [2019-09-07 20:12:59,126 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-07 20:12:59,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:12:59,156 INFO L93 Difference]: Finished difference Result 15366 states and 16683 transitions. [2019-09-07 20:12:59,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 20:12:59,157 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1580 [2019-09-07 20:12:59,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:12:59,175 INFO L225 Difference]: With dead ends: 15366 [2019-09-07 20:12:59,175 INFO L226 Difference]: Without dead ends: 7876 [2019-09-07 20:12:59,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1659 GetRequests, 1607 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=526, Invalid=2336, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 20:12:59,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7876 states. [2019-09-07 20:12:59,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7876 to 7130. [2019-09-07 20:12:59,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7130 states. [2019-09-07 20:12:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7130 states to 7130 states and 7740 transitions. [2019-09-07 20:12:59,331 INFO L78 Accepts]: Start accepts. Automaton has 7130 states and 7740 transitions. Word has length 1580 [2019-09-07 20:12:59,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:12:59,332 INFO L475 AbstractCegarLoop]: Abstraction has 7130 states and 7740 transitions. [2019-09-07 20:12:59,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 20:12:59,333 INFO L276 IsEmpty]: Start isEmpty. Operand 7130 states and 7740 transitions. [2019-09-07 20:12:59,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1709 [2019-09-07 20:12:59,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:12:59,385 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:12:59,386 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:12:59,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:12:59,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1592848241, now seen corresponding path program 1 times [2019-09-07 20:12:59,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:12:59,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:12:59,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:59,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:59,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 4445 proven. 158 refuted. 0 times theorem prover too weak. 4329 trivial. 0 not checked. [2019-09-07 20:13:01,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:13:01,562 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 20:13:01,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:01,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 2309 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 20:13:01,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:13:02,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:13:02,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:13:08,112 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-07 20:13:12,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:13:13,646 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 2946 proven. 76 refuted. 0 times theorem prover too weak. 5910 trivial. 0 not checked. [2019-09-07 20:13:13,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:13:13,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2019-09-07 20:13:13,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 20:13:13,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 20:13:13,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=176, Unknown=2, NotChecked=0, Total=240 [2019-09-07 20:13:13,654 INFO L87 Difference]: Start difference. First operand 7130 states and 7740 transitions. Second operand 16 states. [2019-09-07 20:13:20,393 WARN L188 SmtUtils]: Spent 4.08 s on a formula simplification that was a NOOP. DAG size: 33 [2019-09-07 20:13:23,869 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 30 DAG size of output: 18 [2019-09-07 20:13:28,675 WARN L188 SmtUtils]: Spent 4.11 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-07 20:13:33,472 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 38 DAG size of output: 26 [2019-09-07 20:13:33,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:13:33,941 INFO L93 Difference]: Finished difference Result 19794 states and 21659 transitions. [2019-09-07 20:13:33,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 20:13:33,942 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1708 [2019-09-07 20:13:33,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:13:33,968 INFO L225 Difference]: With dead ends: 19794 [2019-09-07 20:13:33,969 INFO L226 Difference]: Without dead ends: 12670 [2019-09-07 20:13:33,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1761 GetRequests, 1726 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=334, Invalid=924, Unknown=2, NotChecked=0, Total=1260 [2019-09-07 20:13:33,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12670 states. [2019-09-07 20:13:34,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12670 to 10820. [2019-09-07 20:13:34,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10820 states. [2019-09-07 20:13:34,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10820 states to 10820 states and 11504 transitions. [2019-09-07 20:13:34,160 INFO L78 Accepts]: Start accepts. Automaton has 10820 states and 11504 transitions. Word has length 1708 [2019-09-07 20:13:34,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:13:34,162 INFO L475 AbstractCegarLoop]: Abstraction has 10820 states and 11504 transitions. [2019-09-07 20:13:34,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 20:13:34,162 INFO L276 IsEmpty]: Start isEmpty. Operand 10820 states and 11504 transitions. [2019-09-07 20:13:34,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1809 [2019-09-07 20:13:34,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:13:34,210 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:13:34,210 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:13:34,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:13:34,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1532947659, now seen corresponding path program 1 times [2019-09-07 20:13:34,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:13:34,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:13:34,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:34,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:34,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:37,147 INFO L134 CoverageAnalysis]: Checked inductivity of 9967 backedges. 2024 proven. 455 refuted. 0 times theorem prover too weak. 7488 trivial. 0 not checked. [2019-09-07 20:13:37,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:13:37,148 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 20:13:37,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:37,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 2450 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:13:37,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:13:38,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9967 backedges. 4031 proven. 2 refuted. 0 times theorem prover too weak. 5934 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:13:38,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:13:38,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-07 20:13:38,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 20:13:38,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 20:13:38,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:13:38,761 INFO L87 Difference]: Start difference. First operand 10820 states and 11504 transitions. Second operand 11 states. [2019-09-07 20:13:42,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:13:42,063 INFO L93 Difference]: Finished difference Result 21972 states and 23311 transitions. [2019-09-07 20:13:42,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 20:13:42,064 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1808 [2019-09-07 20:13:42,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:13:42,073 INFO L225 Difference]: With dead ends: 21972 [2019-09-07 20:13:42,073 INFO L226 Difference]: Without dead ends: 5182 [2019-09-07 20:13:42,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1852 GetRequests, 1822 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=239, Invalid=691, Unknown=0, NotChecked=0, Total=930 [2019-09-07 20:13:42,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5182 states. [2019-09-07 20:13:42,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5182 to 4448. [2019-09-07 20:13:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4448 states. [2019-09-07 20:13:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4448 states to 4448 states and 4532 transitions. [2019-09-07 20:13:42,147 INFO L78 Accepts]: Start accepts. Automaton has 4448 states and 4532 transitions. Word has length 1808 [2019-09-07 20:13:42,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:13:42,149 INFO L475 AbstractCegarLoop]: Abstraction has 4448 states and 4532 transitions. [2019-09-07 20:13:42,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 20:13:42,149 INFO L276 IsEmpty]: Start isEmpty. Operand 4448 states and 4532 transitions. [2019-09-07 20:13:42,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1866 [2019-09-07 20:13:42,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:13:42,184 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 9, 8, 8, 8, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-09-07 20:13:42,185 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:13:42,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:13:42,185 INFO L82 PathProgramCache]: Analyzing trace with hash -735171182, now seen corresponding path program 1 times [2019-09-07 20:13:42,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:13:42,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:13:42,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:42,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:42,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:46,828 INFO L134 CoverageAnalysis]: Checked inductivity of 11244 backedges. 1978 proven. 3255 refuted. 0 times theorem prover too weak. 6011 trivial. 0 not checked. [2019-09-07 20:13:46,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:13:46,828 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:13:46,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:47,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 2541 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 20:13:47,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:13:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 11244 backedges. 5190 proven. 6 refuted. 0 times theorem prover too weak. 6048 trivial. 0 not checked. [2019-09-07 20:13:49,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:13:49,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-09-07 20:13:49,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 20:13:49,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 20:13:49,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-09-07 20:13:49,041 INFO L87 Difference]: Start difference. First operand 4448 states and 4532 transitions. Second operand 16 states. [2019-09-07 20:13:54,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:13:54,378 INFO L93 Difference]: Finished difference Result 6425 states and 6611 transitions. [2019-09-07 20:13:54,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 20:13:54,379 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1865 [2019-09-07 20:13:54,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:13:54,386 INFO L225 Difference]: With dead ends: 6425 [2019-09-07 20:13:54,386 INFO L226 Difference]: Without dead ends: 4129 [2019-09-07 20:13:54,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1937 GetRequests, 1897 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=369, Invalid=1353, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 20:13:54,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2019-09-07 20:13:54,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 4070. [2019-09-07 20:13:54,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4070 states. [2019-09-07 20:13:54,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4070 states to 4070 states and 4132 transitions. [2019-09-07 20:13:54,441 INFO L78 Accepts]: Start accepts. Automaton has 4070 states and 4132 transitions. Word has length 1865 [2019-09-07 20:13:54,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:13:54,443 INFO L475 AbstractCegarLoop]: Abstraction has 4070 states and 4132 transitions. [2019-09-07 20:13:54,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 20:13:54,443 INFO L276 IsEmpty]: Start isEmpty. Operand 4070 states and 4132 transitions. [2019-09-07 20:13:54,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1884 [2019-09-07 20:13:54,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:13:54,476 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 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] [2019-09-07 20:13:54,477 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:13:54,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:13:54,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1154295674, now seen corresponding path program 1 times [2019-09-07 20:13:54,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:13:54,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:13:54,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:54,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:54,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:13:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:56,588 INFO L134 CoverageAnalysis]: Checked inductivity of 11385 backedges. 2868 proven. 76 refuted. 0 times theorem prover too weak. 8441 trivial. 0 not checked. [2019-09-07 20:13:56,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:13:56,589 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:13:56,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:13:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:13:56,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 2559 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 20:13:57,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:13:57,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:13:57,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:13:58,713 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-09-07 20:13:58,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:13:58,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:13:58,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:13:58,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:13:58,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:13:58,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:13:58,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:13:58,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:14:23,229 WARN L188 SmtUtils]: Spent 24.39 s on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-07 20:14:23,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 20:14:25,529 INFO L134 CoverageAnalysis]: Checked inductivity of 11385 backedges. 4872 proven. 528 refuted. 0 times theorem prover too weak. 5985 trivial. 0 not checked. [2019-09-07 20:14:25,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:14:25,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 15 [2019-09-07 20:14:25,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 20:14:25,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 20:14:25,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=167, Unknown=1, NotChecked=0, Total=210 [2019-09-07 20:14:25,537 INFO L87 Difference]: Start difference. First operand 4070 states and 4132 transitions. Second operand 15 states. [2019-09-07 20:20:25,057 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-09-07 20:20:34,489 WARN L188 SmtUtils]: Spent 985.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-09-07 20:22:58,533 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification that was a NOOP. DAG size: 17